./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for memory safety (deref-memtrack)
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 16:47:06,089 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 16:47:06,173 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-08 16:47:06,182 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 16:47:06,182 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 16:47:06,217 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 16:47:06,218 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 16:47:06,218 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 16:47:06,219 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 16:47:06,220 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 16:47:06,220 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 16:47:06,221 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 16:47:06,222 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 16:47:06,223 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 16:47:06,223 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 16:47:06,224 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 16:47:06,225 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 16:47:06,225 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 16:47:06,226 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 16:47:06,226 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 16:47:06,227 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2024-11-08 16:47:06,231 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2024-11-08 16:47:06,231 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2024-11-08 16:47:06,232 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 16:47:06,232 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-08 16:47:06,233 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 16:47:06,233 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-08 16:47:06,233 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 16:47:06,234 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 16:47:06,234 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 16:47:06,235 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 16:47:06,235 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 16:47:06,236 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 16:47:06,236 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:47:06,237 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 16:47:06,237 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 16:47:06,238 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-08 16:47:06,238 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 16:47:06,239 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 16:47:06,239 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 16:47:06,240 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 16:47:06,241 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 16:47:06,241 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3
[2024-11-08 16:47:06,522 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 16:47:06,558 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 16:47:06,561 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 16:47:06,563 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 16:47:06,564 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 16:47:06,566 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
Unable to find full path for "g++"
[2024-11-08 16:47:09,004 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 16:47:09,269 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 16:47:09,269 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-08 16:47:09,304 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/data/b33713584/0f79b631e1254512a9ea629e4bd52315/FLAGe003b1cee
[2024-11-08 16:47:09,325 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/data/b33713584/0f79b631e1254512a9ea629e4bd52315
[2024-11-08 16:47:09,328 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 16:47:09,329 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 16:47:09,331 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 16:47:09,331 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 16:47:09,341 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 16:47:09,342 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:47:09" (1/1) ...
[2024-11-08 16:47:09,345 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347788ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:09, skipping insertion in model container
[2024-11-08 16:47:09,346 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:47:09" (1/1) ...
[2024-11-08 16:47:09,424 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 16:47:10,009 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:47:10,023 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 16:47:10,125 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:47:10,166 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 16:47:10,166 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10 WrapperNode
[2024-11-08 16:47:10,167 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 16:47:10,168 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 16:47:10,168 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 16:47:10,169 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 16:47:10,177 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,211 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,247 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137
[2024-11-08 16:47:10,247 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 16:47:10,248 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 16:47:10,248 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 16:47:10,248 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 16:47:10,260 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,261 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,265 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,286 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 16:47:10,286 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,286 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,298 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,303 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,306 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,308 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,313 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 16:47:10,314 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 16:47:10,314 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 16:47:10,314 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 16:47:10,315 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (1/1) ...
[2024-11-08 16:47:10,324 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:47:10,347 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:47:10,369 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 16:47:10,376 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 16:47:10,405 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 16:47:10,406 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 16:47:10,406 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-08 16:47:10,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-08 16:47:10,406 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-08 16:47:10,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-08 16:47:10,406 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-11-08 16:47:10,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-11-08 16:47:10,407 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 16:47:10,407 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 16:47:10,407 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 16:47:10,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 16:47:10,409 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-08 16:47:10,567 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 16:47:10,569 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 16:47:11,059 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 16:47:11,060 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 16:47:11,400 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 16:47:11,400 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 16:47:11,400 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:11 BoogieIcfgContainer
[2024-11-08 16:47:11,401 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 16:47:11,404 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 16:47:11,405 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 16:47:11,409 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 16:47:11,410 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:47:09" (1/3) ...
[2024-11-08 16:47:11,411 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385ef18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:11, skipping insertion in model container
[2024-11-08 16:47:11,411 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:10" (2/3) ...
[2024-11-08 16:47:11,412 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385ef18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:11, skipping insertion in model container
[2024-11-08 16:47:11,412 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:11" (3/3) ...
[2024-11-08 16:47:11,415 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-08 16:47:11,438 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 16:47:11,439 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-08 16:47:11,440 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 16:47:11,521 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 16:47:11,562 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow
[2024-11-08 16:47:11,605 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-11-08 16:47:11,606 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 16:47:11,609 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. 
[2024-11-08 16:47:11,609 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow
[2024-11-08 16:47:11,613 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow
[2024-11-08 16:47:11,623 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 16:47:11,630 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@43e71d42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 16:47:11,630 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-08 16:47:11,635 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 16:47:11,636 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-08 16:47:11,636 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 16:47:11,636 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:11,637 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-08 16:47:11,637 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:11,644 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:11,644 INFO  L85        PathProgramCache]: Analyzing trace with hash 14218462, now seen corresponding path program 1 times
[2024-11-08 16:47:11,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:11,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466268681]
[2024-11-08 16:47:11,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:11,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:11,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:12,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:12,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:12,232 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466268681]
[2024-11-08 16:47:12,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466268681] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:12,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:12,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 16:47:12,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191178376]
[2024-11-08 16:47:12,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:12,246 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:47:12,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:12,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:47:12,282 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:47:12,284 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44
[2024-11-08 16:47:12,288 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:12,288 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:12,288 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44
[2024-11-08 16:47:12,289 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:13,142 INFO  L124   PetriNetUnfolderBase]: 1178/2120 cut-off events.
[2024-11-08 16:47:13,142 INFO  L125   PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES.
[2024-11-08 16:47:13,151 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 2120 events. 1178/2120 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14211 event pairs, 188 based on Foata normal form. 120/2232 useless extension candidates. Maximal degree in co-relation 3899. Up to 1420 conditions per place. 
[2024-11-08 16:47:13,168 INFO  L140   encePairwiseOnDemand]: 39/44 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions.
[2024-11-08 16:47:13,169 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 207 flow
[2024-11-08 16:47:13,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 16:47:13,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 16:47:13,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions.
[2024-11-08 16:47:13,180 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.7348484848484849
[2024-11-08 16:47:13,182 INFO  L175             Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions.
[2024-11-08 16:47:13,183 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 207 flow
[2024-11-08 16:47:13,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-08 16:47:13,188 INFO  L231             Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow
[2024-11-08 16:47:13,190 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36}
[2024-11-08 16:47:13,194 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places.
[2024-11-08 16:47:13,194 INFO  L471      AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow
[2024-11-08 16:47:13,195 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:13,195 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:13,195 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:13,196 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 16:47:13,196 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:13,197 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:13,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 1747009556, now seen corresponding path program 1 times
[2024-11-08 16:47:13,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:13,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745523390]
[2024-11-08 16:47:13,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:13,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:13,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:13,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:13,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:13,344 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745523390]
[2024-11-08 16:47:13,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745523390] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:13,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:13,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 16:47:13,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991511038]
[2024-11-08 16:47:13,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:13,346 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:47:13,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:13,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:47:13,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:47:13,348 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-08 16:47:13,349 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:13,349 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:13,349 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-08 16:47:13,350 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:13,776 INFO  L124   PetriNetUnfolderBase]: 1045/1829 cut-off events.
[2024-11-08 16:47:13,776 INFO  L125   PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES.
[2024-11-08 16:47:13,781 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 1829 events. 1045/1829 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11565 event pairs, 1045 based on Foata normal form. 60/1862 useless extension candidates. Maximal degree in co-relation 3543. Up to 1558 conditions per place. 
[2024-11-08 16:47:13,789 INFO  L140   encePairwiseOnDemand]: 42/44 looper letters, 20 selfloop transitions, 1 changer transitions 1/35 dead transitions.
[2024-11-08 16:47:13,789 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 124 flow
[2024-11-08 16:47:13,790 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 16:47:13,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 16:47:13,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-11-08 16:47:13,791 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5378787878787878
[2024-11-08 16:47:13,792 INFO  L175             Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 71 transitions.
[2024-11-08 16:47:13,792 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 124 flow
[2024-11-08 16:47:13,792 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 16:47:13,793 INFO  L231             Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow
[2024-11-08 16:47:13,795 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34}
[2024-11-08 16:47:13,795 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places.
[2024-11-08 16:47:13,795 INFO  L471      AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow
[2024-11-08 16:47:13,796 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:13,796 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:13,796 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:13,796 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 16:47:13,798 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:13,798 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:13,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 1747011048, now seen corresponding path program 1 times
[2024-11-08 16:47:13,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:13,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873271782]
[2024-11-08 16:47:13,799 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:13,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:13,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:15,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:15,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:15,005 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873271782]
[2024-11-08 16:47:15,005 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873271782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:15,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:15,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 16:47:15,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360985446]
[2024-11-08 16:47:15,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:15,007 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:47:15,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:15,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:47:15,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:47:15,023 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-11-08 16:47:15,024 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand  has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:15,024 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:15,024 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-11-08 16:47:15,024 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:16,933 INFO  L124   PetriNetUnfolderBase]: 2817/4661 cut-off events.
[2024-11-08 16:47:16,934 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 16:47:16,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8851 conditions, 4661 events. 2817/4661 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 30576 event pairs, 373 based on Foata normal form. 0/4553 useless extension candidates. Maximal degree in co-relation 8845. Up to 2290 conditions per place. 
[2024-11-08 16:47:16,960 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 43 selfloop transitions, 11 changer transitions 80/144 dead transitions.
[2024-11-08 16:47:16,961 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 144 transitions, 572 flow
[2024-11-08 16:47:16,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-08 16:47:16,961 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-11-08 16:47:16,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 305 transitions.
[2024-11-08 16:47:16,964 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5776515151515151
[2024-11-08 16:47:16,965 INFO  L175             Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 305 transitions.
[2024-11-08 16:47:16,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 144 transitions, 572 flow
[2024-11-08 16:47:16,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 144 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 16:47:16,972 INFO  L231             Difference]: Finished difference. Result has 62 places, 42 transitions, 185 flow
[2024-11-08 16:47:16,973 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=185, PETRI_PLACES=62, PETRI_TRANSITIONS=42}
[2024-11-08 16:47:16,974 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places.
[2024-11-08 16:47:16,975 INFO  L471      AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 185 flow
[2024-11-08 16:47:16,975 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:16,976 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:16,976 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:16,976 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 16:47:16,976 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:16,977 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:16,978 INFO  L85        PathProgramCache]: Analyzing trace with hash 2130500679, now seen corresponding path program 1 times
[2024-11-08 16:47:16,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:16,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345363830]
[2024-11-08 16:47:16,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:16,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:17,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:17,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:17,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:17,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345363830]
[2024-11-08 16:47:17,719 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345363830] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:17,720 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:17,720 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 16:47:17,720 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260676267]
[2024-11-08 16:47:17,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:17,721 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:47:17,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:17,722 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:47:17,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:47:17,739 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-11-08 16:47:17,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 185 flow. Second operand  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:17,741 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:17,741 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-11-08 16:47:17,741 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:19,159 INFO  L124   PetriNetUnfolderBase]: 2058/3358 cut-off events.
[2024-11-08 16:47:19,160 INFO  L125   PetriNetUnfolderBase]: For 5465/5467 co-relation queries the response was YES.
[2024-11-08 16:47:19,175 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12005 conditions, 3358 events. 2058/3358 cut-off events. For 5465/5467 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 20371 event pairs, 318 based on Foata normal form. 105/3456 useless extension candidates. Maximal degree in co-relation 11989. Up to 1882 conditions per place. 
[2024-11-08 16:47:19,196 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 43 selfloop transitions, 11 changer transitions 58/122 dead transitions.
[2024-11-08 16:47:19,196 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 819 flow
[2024-11-08 16:47:19,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-08 16:47:19,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-08 16:47:19,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 240 transitions.
[2024-11-08 16:47:19,199 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5454545454545454
[2024-11-08 16:47:19,200 INFO  L175             Difference]: Start difference. First operand has 62 places, 42 transitions, 185 flow. Second operand 10 states and 240 transitions.
[2024-11-08 16:47:19,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 819 flow
[2024-11-08 16:47:19,242 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 122 transitions, 749 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-11-08 16:47:19,244 INFO  L231             Difference]: Finished difference. Result has 66 places, 48 transitions, 280 flow
[2024-11-08 16:47:19,245 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=66, PETRI_TRANSITIONS=48}
[2024-11-08 16:47:19,245 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places.
[2024-11-08 16:47:19,246 INFO  L471      AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 280 flow
[2024-11-08 16:47:19,246 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:19,246 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:19,247 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:19,247 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 16:47:19,247 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:19,248 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:19,248 INFO  L85        PathProgramCache]: Analyzing trace with hash 578651416, now seen corresponding path program 1 times
[2024-11-08 16:47:19,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:19,249 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856021721]
[2024-11-08 16:47:19,249 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:19,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:19,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:19,594 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:19,594 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:19,594 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856021721]
[2024-11-08 16:47:19,594 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856021721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:19,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:19,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 16:47:19,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849779635]
[2024-11-08 16:47:19,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:19,596 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 16:47:19,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:19,597 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 16:47:19,597 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 16:47:19,598 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-08 16:47:19,599 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 280 flow. Second operand  has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:19,599 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:19,599 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-08 16:47:19,599 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:20,426 INFO  L124   PetriNetUnfolderBase]: 1532/2596 cut-off events.
[2024-11-08 16:47:20,426 INFO  L125   PetriNetUnfolderBase]: For 6098/6336 co-relation queries the response was YES.
[2024-11-08 16:47:20,437 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9700 conditions, 2596 events. 1532/2596 cut-off events. For 6098/6336 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16321 event pairs, 334 based on Foata normal form. 212/2747 useless extension candidates. Maximal degree in co-relation 9678. Up to 1281 conditions per place. 
[2024-11-08 16:47:20,451 INFO  L140   encePairwiseOnDemand]: 39/44 looper letters, 46 selfloop transitions, 8 changer transitions 28/100 dead transitions.
[2024-11-08 16:47:20,452 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 761 flow
[2024-11-08 16:47:20,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-08 16:47:20,452 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-08 16:47:20,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions.
[2024-11-08 16:47:20,453 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5584415584415584
[2024-11-08 16:47:20,454 INFO  L175             Difference]: Start difference. First operand has 66 places, 48 transitions, 280 flow. Second operand 7 states and 172 transitions.
[2024-11-08 16:47:20,454 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 761 flow
[2024-11-08 16:47:20,473 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 734 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-11-08 16:47:20,475 INFO  L231             Difference]: Finished difference. Result has 66 places, 53 transitions, 329 flow
[2024-11-08 16:47:20,475 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=329, PETRI_PLACES=66, PETRI_TRANSITIONS=53}
[2024-11-08 16:47:20,476 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places.
[2024-11-08 16:47:20,476 INFO  L471      AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 329 flow
[2024-11-08 16:47:20,476 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:20,476 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:20,476 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:20,477 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 16:47:20,477 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:20,478 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:20,478 INFO  L85        PathProgramCache]: Analyzing trace with hash 87620974, now seen corresponding path program 1 times
[2024-11-08 16:47:20,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:20,478 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500421313]
[2024-11-08 16:47:20,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:20,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:20,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:21,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:21,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:21,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500421313]
[2024-11-08 16:47:21,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500421313] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:21,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:21,168 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 16:47:21,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723603765]
[2024-11-08 16:47:21,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:21,170 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:47:21,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:21,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:47:21,172 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:47:21,181 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:21,181 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 329 flow. Second operand  has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:21,182 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:21,182 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:21,182 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:22,749 INFO  L124   PetriNetUnfolderBase]: 3382/5603 cut-off events.
[2024-11-08 16:47:22,749 INFO  L125   PetriNetUnfolderBase]: For 9475/9723 co-relation queries the response was YES.
[2024-11-08 16:47:22,787 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20374 conditions, 5603 events. 3382/5603 cut-off events. For 9475/9723 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 37817 event pairs, 385 based on Foata normal form. 286/5821 useless extension candidates. Maximal degree in co-relation 20350. Up to 2416 conditions per place. 
[2024-11-08 16:47:22,808 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 49 selfloop transitions, 5 changer transitions 56/127 dead transitions.
[2024-11-08 16:47:22,809 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 127 transitions, 982 flow
[2024-11-08 16:47:22,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-08 16:47:22,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 16:47:22,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions.
[2024-11-08 16:47:22,810 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5710227272727273
[2024-11-08 16:47:22,811 INFO  L175             Difference]: Start difference. First operand has 66 places, 53 transitions, 329 flow. Second operand 8 states and 201 transitions.
[2024-11-08 16:47:22,811 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 127 transitions, 982 flow
[2024-11-08 16:47:22,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 127 transitions, 964 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-11-08 16:47:22,845 INFO  L231             Difference]: Finished difference. Result has 75 places, 55 transitions, 372 flow
[2024-11-08 16:47:22,846 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=75, PETRI_TRANSITIONS=55}
[2024-11-08 16:47:22,847 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places.
[2024-11-08 16:47:22,847 INFO  L471      AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 372 flow
[2024-11-08 16:47:22,847 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:22,847 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:22,847 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:22,848 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 16:47:22,848 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:22,848 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:22,848 INFO  L85        PathProgramCache]: Analyzing trace with hash 1813059487, now seen corresponding path program 1 times
[2024-11-08 16:47:22,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:22,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221365671]
[2024-11-08 16:47:22,849 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:22,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:22,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:23,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:23,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:23,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221365671]
[2024-11-08 16:47:23,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221365671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:23,196 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:23,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 16:47:23,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600110604]
[2024-11-08 16:47:23,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:23,197 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 16:47:23,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:23,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 16:47:23,198 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 16:47:23,201 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-11-08 16:47:23,202 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 372 flow. Second operand  has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:23,202 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:23,202 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-11-08 16:47:23,202 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:24,436 INFO  L124   PetriNetUnfolderBase]: 3279/5566 cut-off events.
[2024-11-08 16:47:24,437 INFO  L125   PetriNetUnfolderBase]: For 16622/16628 co-relation queries the response was YES.
[2024-11-08 16:47:24,465 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22307 conditions, 5566 events. 3279/5566 cut-off events. For 16622/16628 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 39182 event pairs, 961 based on Foata normal form. 83/5544 useless extension candidates. Maximal degree in co-relation 22279. Up to 2233 conditions per place. 
[2024-11-08 16:47:24,482 INFO  L140   encePairwiseOnDemand]: 39/44 looper letters, 48 selfloop transitions, 6 changer transitions 49/114 dead transitions.
[2024-11-08 16:47:24,482 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 982 flow
[2024-11-08 16:47:24,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-08 16:47:24,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-08 16:47:24,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions.
[2024-11-08 16:47:24,484 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.564935064935065
[2024-11-08 16:47:24,484 INFO  L175             Difference]: Start difference. First operand has 75 places, 55 transitions, 372 flow. Second operand 7 states and 174 transitions.
[2024-11-08 16:47:24,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 982 flow
[2024-11-08 16:47:24,573 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 114 transitions, 946 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-11-08 16:47:24,575 INFO  L231             Difference]: Finished difference. Result has 79 places, 48 transitions, 318 flow
[2024-11-08 16:47:24,576 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=79, PETRI_TRANSITIONS=48}
[2024-11-08 16:47:24,576 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 30 predicate places.
[2024-11-08 16:47:24,576 INFO  L471      AbstractCegarLoop]: Abstraction has has 79 places, 48 transitions, 318 flow
[2024-11-08 16:47:24,577 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:24,577 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:24,577 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:24,577 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 16:47:24,578 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:24,578 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:24,578 INFO  L85        PathProgramCache]: Analyzing trace with hash -2057510662, now seen corresponding path program 1 times
[2024-11-08 16:47:24,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:24,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600113550]
[2024-11-08 16:47:24,579 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:24,579 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:24,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:25,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:25,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:25,425 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600113550]
[2024-11-08 16:47:25,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600113550] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:25,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:25,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 16:47:25,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811073060]
[2024-11-08 16:47:25,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:25,426 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:47:25,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:25,427 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:47:25,427 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:47:25,434 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:25,435 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 48 transitions, 318 flow. Second operand  has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:25,435 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:25,435 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:25,435 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:26,325 INFO  L124   PetriNetUnfolderBase]: 2157/3720 cut-off events.
[2024-11-08 16:47:26,325 INFO  L125   PetriNetUnfolderBase]: For 11363/11467 co-relation queries the response was YES.
[2024-11-08 16:47:26,343 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14718 conditions, 3720 events. 2157/3720 cut-off events. For 11363/11467 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24135 event pairs, 1061 based on Foata normal form. 147/3826 useless extension candidates. Maximal degree in co-relation 14687. Up to 2689 conditions per place. 
[2024-11-08 16:47:26,358 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 49 selfloop transitions, 10 changer transitions 31/106 dead transitions.
[2024-11-08 16:47:26,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 106 transitions, 858 flow
[2024-11-08 16:47:26,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-08 16:47:26,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 16:47:26,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions.
[2024-11-08 16:47:26,363 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5568181818181818
[2024-11-08 16:47:26,363 INFO  L175             Difference]: Start difference. First operand has 79 places, 48 transitions, 318 flow. Second operand 8 states and 196 transitions.
[2024-11-08 16:47:26,363 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 106 transitions, 858 flow
[2024-11-08 16:47:26,383 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 793 flow, removed 20 selfloop flow, removed 11 redundant places.
[2024-11-08 16:47:26,384 INFO  L231             Difference]: Finished difference. Result has 73 places, 55 transitions, 387 flow
[2024-11-08 16:47:26,385 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=73, PETRI_TRANSITIONS=55}
[2024-11-08 16:47:26,387 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places.
[2024-11-08 16:47:26,387 INFO  L471      AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 387 flow
[2024-11-08 16:47:26,387 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:26,387 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:26,388 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:26,388 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 16:47:26,388 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:26,388 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:26,388 INFO  L85        PathProgramCache]: Analyzing trace with hash 1442852716, now seen corresponding path program 2 times
[2024-11-08 16:47:26,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:26,389 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799467224]
[2024-11-08 16:47:26,389 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:26,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:26,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:27,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:27,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:27,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799467224]
[2024-11-08 16:47:27,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799467224] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:27,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:27,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:47:27,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248120810]
[2024-11-08 16:47:27,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:27,787 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 16:47:27,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:27,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 16:47:27,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:47:27,790 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:27,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 387 flow. Second operand  has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:27,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:27,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:27,791 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:29,141 INFO  L124   PetriNetUnfolderBase]: 2177/3751 cut-off events.
[2024-11-08 16:47:29,142 INFO  L125   PetriNetUnfolderBase]: For 10661/10768 co-relation queries the response was YES.
[2024-11-08 16:47:29,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15381 conditions, 3751 events. 2177/3751 cut-off events. For 10661/10768 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24392 event pairs, 1016 based on Foata normal form. 151/3861 useless extension candidates. Maximal degree in co-relation 15353. Up to 2696 conditions per place. 
[2024-11-08 16:47:29,179 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 59 selfloop transitions, 20 changer transitions 40/135 dead transitions.
[2024-11-08 16:47:29,180 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 1180 flow
[2024-11-08 16:47:29,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-08 16:47:29,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-11-08 16:47:29,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 280 transitions.
[2024-11-08 16:47:29,182 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2024-11-08 16:47:29,182 INFO  L175             Difference]: Start difference. First operand has 73 places, 55 transitions, 387 flow. Second operand 12 states and 280 transitions.
[2024-11-08 16:47:29,182 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 1180 flow
[2024-11-08 16:47:29,203 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 1120 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-11-08 16:47:29,205 INFO  L231             Difference]: Finished difference. Result has 82 places, 67 transitions, 561 flow
[2024-11-08 16:47:29,205 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=561, PETRI_PLACES=82, PETRI_TRANSITIONS=67}
[2024-11-08 16:47:29,206 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places.
[2024-11-08 16:47:29,206 INFO  L471      AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 561 flow
[2024-11-08 16:47:29,207 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:29,207 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:29,207 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:29,207 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 16:47:29,207 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:29,208 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:29,208 INFO  L85        PathProgramCache]: Analyzing trace with hash 751619244, now seen corresponding path program 1 times
[2024-11-08 16:47:29,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:29,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009632145]
[2024-11-08 16:47:29,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:29,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:29,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:29,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:29,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:29,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009632145]
[2024-11-08 16:47:29,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009632145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:29,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:29,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 16:47:29,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961174706]
[2024-11-08 16:47:29,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:29,708 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 16:47:29,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:29,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 16:47:29,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-08 16:47:29,714 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:29,714 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 561 flow. Second operand  has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:29,714 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:29,715 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:29,715 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:30,759 INFO  L124   PetriNetUnfolderBase]: 3098/5299 cut-off events.
[2024-11-08 16:47:30,759 INFO  L125   PetriNetUnfolderBase]: For 21157/21303 co-relation queries the response was YES.
[2024-11-08 16:47:30,776 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23460 conditions, 5299 events. 3098/5299 cut-off events. For 21157/21303 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 36790 event pairs, 905 based on Foata normal form. 222/5494 useless extension candidates. Maximal degree in co-relation 23428. Up to 2308 conditions per place. 
[2024-11-08 16:47:30,791 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 63 selfloop transitions, 13 changer transitions 33/125 dead transitions.
[2024-11-08 16:47:30,791 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 125 transitions, 1178 flow
[2024-11-08 16:47:30,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-08 16:47:30,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-08 16:47:30,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions.
[2024-11-08 16:47:30,793 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5681818181818182
[2024-11-08 16:47:30,793 INFO  L175             Difference]: Start difference. First operand has 82 places, 67 transitions, 561 flow. Second operand 7 states and 175 transitions.
[2024-11-08 16:47:30,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 125 transitions, 1178 flow
[2024-11-08 16:47:30,902 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 1098 flow, removed 40 selfloop flow, removed 6 redundant places.
[2024-11-08 16:47:30,904 INFO  L231             Difference]: Finished difference. Result has 81 places, 71 transitions, 588 flow
[2024-11-08 16:47:30,904 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=81, PETRI_TRANSITIONS=71}
[2024-11-08 16:47:30,905 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places.
[2024-11-08 16:47:30,905 INFO  L471      AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 588 flow
[2024-11-08 16:47:30,905 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:30,905 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:30,906 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:30,906 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 16:47:30,906 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:30,906 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:30,906 INFO  L85        PathProgramCache]: Analyzing trace with hash -2106820864, now seen corresponding path program 2 times
[2024-11-08 16:47:30,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:30,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223035551]
[2024-11-08 16:47:30,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:30,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:30,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:32,396 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:32,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:32,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223035551]
[2024-11-08 16:47:32,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223035551] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:32,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:32,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:47:32,397 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152161166]
[2024-11-08 16:47:32,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:32,398 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 16:47:32,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:32,399 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 16:47:32,399 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:47:32,401 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:32,402 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 588 flow. Second operand  has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:32,402 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:32,402 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:32,402 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:33,773 INFO  L124   PetriNetUnfolderBase]: 2220/3924 cut-off events.
[2024-11-08 16:47:33,774 INFO  L125   PetriNetUnfolderBase]: For 16893/17020 co-relation queries the response was YES.
[2024-11-08 16:47:33,787 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17489 conditions, 3924 events. 2220/3924 cut-off events. For 16893/17020 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26613 event pairs, 385 based on Foata normal form. 202/4116 useless extension candidates. Maximal degree in co-relation 17456. Up to 2325 conditions per place. 
[2024-11-08 16:47:33,801 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 75 selfloop transitions, 24 changer transitions 26/141 dead transitions.
[2024-11-08 16:47:33,801 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 1353 flow
[2024-11-08 16:47:33,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-08 16:47:33,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 16:47:33,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions.
[2024-11-08 16:47:33,804 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5738636363636364
[2024-11-08 16:47:33,804 INFO  L175             Difference]: Start difference. First operand has 81 places, 71 transitions, 588 flow. Second operand 8 states and 202 transitions.
[2024-11-08 16:47:33,804 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 1353 flow
[2024-11-08 16:47:33,840 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 141 transitions, 1307 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-11-08 16:47:33,843 INFO  L231             Difference]: Finished difference. Result has 87 places, 84 transitions, 804 flow
[2024-11-08 16:47:33,844 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=804, PETRI_PLACES=87, PETRI_TRANSITIONS=84}
[2024-11-08 16:47:33,844 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places.
[2024-11-08 16:47:33,844 INFO  L471      AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 804 flow
[2024-11-08 16:47:33,845 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:33,845 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:33,845 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:33,845 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 16:47:33,846 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:33,850 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:33,851 INFO  L85        PathProgramCache]: Analyzing trace with hash 992712498, now seen corresponding path program 3 times
[2024-11-08 16:47:33,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:33,851 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582272543]
[2024-11-08 16:47:33,851 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:33,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:33,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:35,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:35,531 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:35,531 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582272543]
[2024-11-08 16:47:35,531 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582272543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:35,531 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:35,531 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:47:35,532 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405346704]
[2024-11-08 16:47:35,532 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:35,532 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 16:47:35,532 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:35,533 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 16:47:35,533 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:47:35,539 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:35,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 804 flow. Second operand  has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:35,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:35,540 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:35,540 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:36,693 INFO  L124   PetriNetUnfolderBase]: 2242/4020 cut-off events.
[2024-11-08 16:47:36,693 INFO  L125   PetriNetUnfolderBase]: For 23834/23973 co-relation queries the response was YES.
[2024-11-08 16:47:36,705 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19651 conditions, 4020 events. 2242/4020 cut-off events. For 23834/23973 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 27957 event pairs, 426 based on Foata normal form. 206/4213 useless extension candidates. Maximal degree in co-relation 19615. Up to 2411 conditions per place. 
[2024-11-08 16:47:36,718 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 77 selfloop transitions, 27 changer transitions 26/146 dead transitions.
[2024-11-08 16:47:36,718 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 146 transitions, 1616 flow
[2024-11-08 16:47:36,719 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-08 16:47:36,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 16:47:36,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions.
[2024-11-08 16:47:36,720 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5539772727272727
[2024-11-08 16:47:36,720 INFO  L175             Difference]: Start difference. First operand has 87 places, 84 transitions, 804 flow. Second operand 8 states and 195 transitions.
[2024-11-08 16:47:36,720 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 146 transitions, 1616 flow
[2024-11-08 16:47:36,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 146 transitions, 1554 flow, removed 25 selfloop flow, removed 4 redundant places.
[2024-11-08 16:47:36,758 INFO  L231             Difference]: Finished difference. Result has 93 places, 93 transitions, 995 flow
[2024-11-08 16:47:36,759 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=995, PETRI_PLACES=93, PETRI_TRANSITIONS=93}
[2024-11-08 16:47:36,759 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 44 predicate places.
[2024-11-08 16:47:36,760 INFO  L471      AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 995 flow
[2024-11-08 16:47:36,760 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:36,760 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:36,760 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:36,760 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 16:47:36,761 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:36,761 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:36,761 INFO  L85        PathProgramCache]: Analyzing trace with hash 888539955, now seen corresponding path program 1 times
[2024-11-08 16:47:36,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:36,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709204361]
[2024-11-08 16:47:36,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:36,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:36,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:37,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:37,976 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:37,977 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709204361]
[2024-11-08 16:47:37,980 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709204361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:37,980 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:37,980 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:47:37,980 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607423604]
[2024-11-08 16:47:37,980 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:37,981 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 16:47:37,981 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:37,981 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 16:47:37,981 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:47:37,991 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:37,992 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 995 flow. Second operand  has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:37,992 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:37,992 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:37,992 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:38,975 INFO  L124   PetriNetUnfolderBase]: 2008/3632 cut-off events.
[2024-11-08 16:47:38,976 INFO  L125   PetriNetUnfolderBase]: For 26046/26129 co-relation queries the response was YES.
[2024-11-08 16:47:39,005 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18827 conditions, 3632 events. 2008/3632 cut-off events. For 26046/26129 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 25062 event pairs, 894 based on Foata normal form. 95/3699 useless extension candidates. Maximal degree in co-relation 18788. Up to 2687 conditions per place. 
[2024-11-08 16:47:39,019 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 82 selfloop transitions, 28 changer transitions 31/157 dead transitions.
[2024-11-08 16:47:39,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 157 transitions, 1760 flow
[2024-11-08 16:47:39,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-08 16:47:39,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-08 16:47:39,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions.
[2024-11-08 16:47:39,021 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5386363636363637
[2024-11-08 16:47:39,021 INFO  L175             Difference]: Start difference. First operand has 93 places, 93 transitions, 995 flow. Second operand 10 states and 237 transitions.
[2024-11-08 16:47:39,021 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 157 transitions, 1760 flow
[2024-11-08 16:47:39,061 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 157 transitions, 1683 flow, removed 32 selfloop flow, removed 4 redundant places.
[2024-11-08 16:47:39,064 INFO  L231             Difference]: Finished difference. Result has 102 places, 104 transitions, 1132 flow
[2024-11-08 16:47:39,064 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1132, PETRI_PLACES=102, PETRI_TRANSITIONS=104}
[2024-11-08 16:47:39,065 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 53 predicate places.
[2024-11-08 16:47:39,065 INFO  L471      AbstractCegarLoop]: Abstraction has has 102 places, 104 transitions, 1132 flow
[2024-11-08 16:47:39,065 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:39,066 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:39,066 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:39,066 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-08 16:47:39,066 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:39,066 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:39,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 1373179952, now seen corresponding path program 1 times
[2024-11-08 16:47:39,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:39,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113902738]
[2024-11-08 16:47:39,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:39,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:39,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:39,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:39,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:39,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113902738]
[2024-11-08 16:47:39,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113902738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:39,305 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:39,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 16:47:39,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005389592]
[2024-11-08 16:47:39,306 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:39,306 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 16:47:39,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:39,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 16:47:39,306 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 16:47:39,313 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-11-08 16:47:39,313 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 104 transitions, 1132 flow. Second operand  has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:39,314 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:39,314 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-11-08 16:47:39,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:40,463 INFO  L124   PetriNetUnfolderBase]: 3675/5862 cut-off events.
[2024-11-08 16:47:40,463 INFO  L125   PetriNetUnfolderBase]: For 45759/45940 co-relation queries the response was YES.
[2024-11-08 16:47:40,484 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26876 conditions, 5862 events. 3675/5862 cut-off events. For 45759/45940 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 34728 event pairs, 451 based on Foata normal form. 387/6221 useless extension candidates. Maximal degree in co-relation 26833. Up to 3131 conditions per place. 
[2024-11-08 16:47:40,500 INFO  L140   encePairwiseOnDemand]: 38/44 looper letters, 100 selfloop transitions, 5 changer transitions 9/128 dead transitions.
[2024-11-08 16:47:40,501 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 128 transitions, 1564 flow
[2024-11-08 16:47:40,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 16:47:40,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-08 16:47:40,502 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions.
[2024-11-08 16:47:40,502 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.6022727272727273
[2024-11-08 16:47:40,502 INFO  L175             Difference]: Start difference. First operand has 102 places, 104 transitions, 1132 flow. Second operand 4 states and 106 transitions.
[2024-11-08 16:47:40,502 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 128 transitions, 1564 flow
[2024-11-08 16:47:40,565 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 128 transitions, 1256 flow, removed 87 selfloop flow, removed 19 redundant places.
[2024-11-08 16:47:40,567 INFO  L231             Difference]: Finished difference. Result has 83 places, 74 transitions, 581 flow
[2024-11-08 16:47:40,567 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=581, PETRI_PLACES=83, PETRI_TRANSITIONS=74}
[2024-11-08 16:47:40,568 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places.
[2024-11-08 16:47:40,568 INFO  L471      AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 581 flow
[2024-11-08 16:47:40,568 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:40,568 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:40,568 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:40,569 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-08 16:47:40,569 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:40,569 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:40,569 INFO  L85        PathProgramCache]: Analyzing trace with hash -1640179111, now seen corresponding path program 1 times
[2024-11-08 16:47:40,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:40,570 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125779256]
[2024-11-08 16:47:40,570 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:40,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:40,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:41,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:41,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:41,271 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125779256]
[2024-11-08 16:47:41,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125779256] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:41,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:41,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 16:47:41,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914723376]
[2024-11-08 16:47:41,271 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:41,272 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 16:47:41,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:41,272 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 16:47:41,273 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-08 16:47:41,278 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:41,278 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 581 flow. Second operand  has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:41,278 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:41,279 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:41,279 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:42,405 INFO  L124   PetriNetUnfolderBase]: 2411/4259 cut-off events.
[2024-11-08 16:47:42,405 INFO  L125   PetriNetUnfolderBase]: For 14533/14873 co-relation queries the response was YES.
[2024-11-08 16:47:42,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17750 conditions, 4259 events. 2411/4259 cut-off events. For 14533/14873 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 29129 event pairs, 679 based on Foata normal form. 98/4154 useless extension candidates. Maximal degree in co-relation 17717. Up to 2466 conditions per place. 
[2024-11-08 16:47:42,438 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 66 selfloop transitions, 11 changer transitions 31/126 dead transitions.
[2024-11-08 16:47:42,439 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 126 transitions, 1139 flow
[2024-11-08 16:47:42,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-08 16:47:42,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-08 16:47:42,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions.
[2024-11-08 16:47:42,440 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.525
[2024-11-08 16:47:42,441 INFO  L175             Difference]: Start difference. First operand has 83 places, 74 transitions, 581 flow. Second operand 10 states and 231 transitions.
[2024-11-08 16:47:42,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 126 transitions, 1139 flow
[2024-11-08 16:47:42,464 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 126 transitions, 1131 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-11-08 16:47:42,466 INFO  L231             Difference]: Finished difference. Result has 97 places, 73 transitions, 617 flow
[2024-11-08 16:47:42,466 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=617, PETRI_PLACES=97, PETRI_TRANSITIONS=73}
[2024-11-08 16:47:42,467 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 48 predicate places.
[2024-11-08 16:47:42,467 INFO  L471      AbstractCegarLoop]: Abstraction has has 97 places, 73 transitions, 617 flow
[2024-11-08 16:47:42,467 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:42,467 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:42,468 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:42,468 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-08 16:47:42,468 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:42,468 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:42,468 INFO  L85        PathProgramCache]: Analyzing trace with hash -1599357543, now seen corresponding path program 1 times
[2024-11-08 16:47:42,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:42,469 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715857686]
[2024-11-08 16:47:42,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:42,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:42,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:44,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:44,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:44,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715857686]
[2024-11-08 16:47:44,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715857686] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:44,730 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:44,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-08 16:47:44,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314978195]
[2024-11-08 16:47:44,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:44,731 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 16:47:44,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:44,732 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 16:47:44,732 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2024-11-08 16:47:44,742 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:44,742 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 73 transitions, 617 flow. Second operand  has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:44,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:44,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:44,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:46,433 INFO  L124   PetriNetUnfolderBase]: 2656/4732 cut-off events.
[2024-11-08 16:47:46,433 INFO  L125   PetriNetUnfolderBase]: For 20658/20971 co-relation queries the response was YES.
[2024-11-08 16:47:46,450 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20981 conditions, 4732 events. 2656/4732 cut-off events. For 20658/20971 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 32684 event pairs, 913 based on Foata normal form. 177/4699 useless extension candidates. Maximal degree in co-relation 20941. Up to 2009 conditions per place. 
[2024-11-08 16:47:46,458 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 85 selfloop transitions, 19 changer transitions 57/179 dead transitions.
[2024-11-08 16:47:46,458 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 179 transitions, 1765 flow
[2024-11-08 16:47:46,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-11-08 16:47:46,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-11-08 16:47:46,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 316 transitions.
[2024-11-08 16:47:46,460 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5524475524475524
[2024-11-08 16:47:46,460 INFO  L175             Difference]: Start difference. First operand has 97 places, 73 transitions, 617 flow. Second operand 13 states and 316 transitions.
[2024-11-08 16:47:46,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 179 transitions, 1765 flow
[2024-11-08 16:47:46,523 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 179 transitions, 1652 flow, removed 36 selfloop flow, removed 13 redundant places.
[2024-11-08 16:47:46,525 INFO  L231             Difference]: Finished difference. Result has 101 places, 75 transitions, 668 flow
[2024-11-08 16:47:46,526 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=668, PETRI_PLACES=101, PETRI_TRANSITIONS=75}
[2024-11-08 16:47:46,526 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 52 predicate places.
[2024-11-08 16:47:46,526 INFO  L471      AbstractCegarLoop]: Abstraction has has 101 places, 75 transitions, 668 flow
[2024-11-08 16:47:46,527 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:46,527 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:46,527 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:46,527 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-08 16:47:46,527 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:46,528 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:46,528 INFO  L85        PathProgramCache]: Analyzing trace with hash 1119508951, now seen corresponding path program 2 times
[2024-11-08 16:47:46,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:46,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996260772]
[2024-11-08 16:47:46,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:46,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:46,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:47,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:47,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:47,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996260772]
[2024-11-08 16:47:47,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996260772] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:47,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:47,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:47:47,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195796209]
[2024-11-08 16:47:47,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:47,626 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 16:47:47,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:47,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 16:47:47,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:47:47,640 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:47,640 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 75 transitions, 668 flow. Second operand  has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:47,641 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:47,641 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:47,641 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:48,627 INFO  L124   PetriNetUnfolderBase]: 2188/4016 cut-off events.
[2024-11-08 16:47:48,627 INFO  L125   PetriNetUnfolderBase]: For 17388/17648 co-relation queries the response was YES.
[2024-11-08 16:47:48,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17914 conditions, 4016 events. 2188/4016 cut-off events. For 17388/17648 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 28006 event pairs, 1159 based on Foata normal form. 103/3913 useless extension candidates. Maximal degree in co-relation 17874. Up to 2908 conditions per place. 
[2024-11-08 16:47:48,652 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 61 selfloop transitions, 28 changer transitions 28/135 dead transitions.
[2024-11-08 16:47:48,652 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 1324 flow
[2024-11-08 16:47:48,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-08 16:47:48,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-11-08 16:47:48,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 271 transitions.
[2024-11-08 16:47:48,654 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5132575757575758
[2024-11-08 16:47:48,654 INFO  L175             Difference]: Start difference. First operand has 101 places, 75 transitions, 668 flow. Second operand 12 states and 271 transitions.
[2024-11-08 16:47:48,654 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 1324 flow
[2024-11-08 16:47:48,699 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 135 transitions, 1272 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-11-08 16:47:48,701 INFO  L231             Difference]: Finished difference. Result has 109 places, 80 transitions, 808 flow
[2024-11-08 16:47:48,702 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=808, PETRI_PLACES=109, PETRI_TRANSITIONS=80}
[2024-11-08 16:47:48,702 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 60 predicate places.
[2024-11-08 16:47:48,702 INFO  L471      AbstractCegarLoop]: Abstraction has has 109 places, 80 transitions, 808 flow
[2024-11-08 16:47:48,703 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:48,703 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:48,703 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:48,703 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-08 16:47:48,703 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:48,704 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:48,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 1779548841, now seen corresponding path program 3 times
[2024-11-08 16:47:48,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:48,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595900720]
[2024-11-08 16:47:48,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:48,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:48,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:50,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:50,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:50,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595900720]
[2024-11-08 16:47:50,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595900720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:50,301 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:50,301 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:47:50,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626039695]
[2024-11-08 16:47:50,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:50,301 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 16:47:50,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:50,302 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 16:47:50,302 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:47:50,306 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:50,307 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 80 transitions, 808 flow. Second operand  has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:50,307 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:50,307 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:50,307 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:51,269 INFO  L124   PetriNetUnfolderBase]: 2100/3889 cut-off events.
[2024-11-08 16:47:51,269 INFO  L125   PetriNetUnfolderBase]: For 24463/24737 co-relation queries the response was YES.
[2024-11-08 16:47:51,285 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18856 conditions, 3889 events. 2100/3889 cut-off events. For 24463/24737 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27321 event pairs, 1197 based on Foata normal form. 114/3800 useless extension candidates. Maximal degree in co-relation 18813. Up to 2791 conditions per place. 
[2024-11-08 16:47:51,292 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 60 selfloop transitions, 24 changer transitions 23/125 dead transitions.
[2024-11-08 16:47:51,292 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 125 transitions, 1382 flow
[2024-11-08 16:47:51,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-08 16:47:51,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-08 16:47:51,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions.
[2024-11-08 16:47:51,293 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.525
[2024-11-08 16:47:51,294 INFO  L175             Difference]: Start difference. First operand has 109 places, 80 transitions, 808 flow. Second operand 10 states and 231 transitions.
[2024-11-08 16:47:51,294 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 125 transitions, 1382 flow
[2024-11-08 16:47:51,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 125 transitions, 1278 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-11-08 16:47:51,346 INFO  L231             Difference]: Finished difference. Result has 112 places, 79 transitions, 768 flow
[2024-11-08 16:47:51,346 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=768, PETRI_PLACES=112, PETRI_TRANSITIONS=79}
[2024-11-08 16:47:51,347 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 63 predicate places.
[2024-11-08 16:47:51,347 INFO  L471      AbstractCegarLoop]: Abstraction has has 112 places, 79 transitions, 768 flow
[2024-11-08 16:47:51,347 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:51,347 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:51,347 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:51,348 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-08 16:47:51,348 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:51,348 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:51,348 INFO  L85        PathProgramCache]: Analyzing trace with hash -1145690199, now seen corresponding path program 4 times
[2024-11-08 16:47:51,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:51,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011668765]
[2024-11-08 16:47:51,349 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:51,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:51,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:51,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:51,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:51,601 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011668765]
[2024-11-08 16:47:51,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011668765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:51,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:51,601 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 16:47:51,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673526418]
[2024-11-08 16:47:51,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:51,602 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 16:47:51,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:51,602 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 16:47:51,602 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 16:47:51,615 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-11-08 16:47:51,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 79 transitions, 768 flow. Second operand  has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:51,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:51,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-11-08 16:47:51,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:52,327 INFO  L124   PetriNetUnfolderBase]: 2567/4229 cut-off events.
[2024-11-08 16:47:52,328 INFO  L125   PetriNetUnfolderBase]: For 37405/37556 co-relation queries the response was YES.
[2024-11-08 16:47:52,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20402 conditions, 4229 events. 2567/4229 cut-off events. For 37405/37556 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 24489 event pairs, 272 based on Foata normal form. 345/4552 useless extension candidates. Maximal degree in co-relation 20357. Up to 1299 conditions per place. 
[2024-11-08 16:47:52,351 INFO  L140   encePairwiseOnDemand]: 38/44 looper letters, 88 selfloop transitions, 8 changer transitions 16/125 dead transitions.
[2024-11-08 16:47:52,351 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 125 transitions, 1491 flow
[2024-11-08 16:47:52,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-08 16:47:52,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 16:47:52,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions.
[2024-11-08 16:47:52,352 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.6136363636363636
[2024-11-08 16:47:52,352 INFO  L175             Difference]: Start difference. First operand has 112 places, 79 transitions, 768 flow. Second operand 5 states and 135 transitions.
[2024-11-08 16:47:52,353 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 125 transitions, 1491 flow
[2024-11-08 16:47:52,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 125 transitions, 1343 flow, removed 46 selfloop flow, removed 10 redundant places.
[2024-11-08 16:47:52,389 INFO  L231             Difference]: Finished difference. Result has 103 places, 65 transitions, 553 flow
[2024-11-08 16:47:52,390 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=553, PETRI_PLACES=103, PETRI_TRANSITIONS=65}
[2024-11-08 16:47:52,390 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 54 predicate places.
[2024-11-08 16:47:52,390 INFO  L471      AbstractCegarLoop]: Abstraction has has 103 places, 65 transitions, 553 flow
[2024-11-08 16:47:52,390 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:52,391 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:52,391 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:52,391 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-08 16:47:52,391 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:52,392 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:52,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -1478145826, now seen corresponding path program 1 times
[2024-11-08 16:47:52,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:52,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634293400]
[2024-11-08 16:47:52,392 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:52,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:52,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:53,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:53,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:53,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634293400]
[2024-11-08 16:47:53,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634293400] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:53,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:53,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-08 16:47:53,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388159004]
[2024-11-08 16:47:53,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:53,788 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-08 16:47:53,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:53,789 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-08 16:47:53,789 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2024-11-08 16:47:53,813 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:53,814 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 65 transitions, 553 flow. Second operand  has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:53,814 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:53,814 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:53,814 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:54,776 INFO  L124   PetriNetUnfolderBase]: 1245/2468 cut-off events.
[2024-11-08 16:47:54,776 INFO  L125   PetriNetUnfolderBase]: For 12047/12682 co-relation queries the response was YES.
[2024-11-08 16:47:54,785 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10981 conditions, 2468 events. 1245/2468 cut-off events. For 12047/12682 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16450 event pairs, 556 based on Foata normal form. 80/2364 useless extension candidates. Maximal degree in co-relation 10939. Up to 1588 conditions per place. 
[2024-11-08 16:47:54,789 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 48 selfloop transitions, 14 changer transitions 23/107 dead transitions.
[2024-11-08 16:47:54,789 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 999 flow
[2024-11-08 16:47:54,790 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-08 16:47:54,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-08 16:47:54,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions.
[2024-11-08 16:47:54,790 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5202020202020202
[2024-11-08 16:47:54,791 INFO  L175             Difference]: Start difference. First operand has 103 places, 65 transitions, 553 flow. Second operand 9 states and 206 transitions.
[2024-11-08 16:47:54,791 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 999 flow
[2024-11-08 16:47:54,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 965 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-11-08 16:47:54,812 INFO  L231             Difference]: Finished difference. Result has 105 places, 67 transitions, 628 flow
[2024-11-08 16:47:54,812 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=628, PETRI_PLACES=105, PETRI_TRANSITIONS=67}
[2024-11-08 16:47:54,812 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 56 predicate places.
[2024-11-08 16:47:54,812 INFO  L471      AbstractCegarLoop]: Abstraction has has 105 places, 67 transitions, 628 flow
[2024-11-08 16:47:54,813 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:54,813 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:54,813 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:54,813 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-08 16:47:54,813 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:54,814 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:54,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -1113732464, now seen corresponding path program 2 times
[2024-11-08 16:47:54,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:54,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105437928]
[2024-11-08 16:47:54,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:54,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:54,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:55,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:55,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:55,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105437928]
[2024-11-08 16:47:55,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105437928] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:55,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:55,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 16:47:55,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017669208]
[2024-11-08 16:47:55,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:55,069 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:47:55,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:55,070 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:47:55,070 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:47:55,076 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-11-08 16:47:55,076 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 67 transitions, 628 flow. Second operand  has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:55,077 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:55,077 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-11-08 16:47:55,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:55,582 INFO  L124   PetriNetUnfolderBase]: 1728/2938 cut-off events.
[2024-11-08 16:47:55,583 INFO  L125   PetriNetUnfolderBase]: For 24794/24869 co-relation queries the response was YES.
[2024-11-08 16:47:55,593 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14269 conditions, 2938 events. 1728/2938 cut-off events. For 24794/24869 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16983 event pairs, 256 based on Foata normal form. 143/3060 useless extension candidates. Maximal degree in co-relation 14227. Up to 1108 conditions per place. 
[2024-11-08 16:47:55,596 INFO  L140   encePairwiseOnDemand]: 38/44 looper letters, 55 selfloop transitions, 11 changer transitions 32/109 dead transitions.
[2024-11-08 16:47:55,597 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 1229 flow
[2024-11-08 16:47:55,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-08 16:47:55,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 16:47:55,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions.
[2024-11-08 16:47:55,598 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5454545454545454
[2024-11-08 16:47:55,598 INFO  L175             Difference]: Start difference. First operand has 105 places, 67 transitions, 628 flow. Second operand 6 states and 144 transitions.
[2024-11-08 16:47:55,598 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 1229 flow
[2024-11-08 16:47:55,623 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 109 transitions, 1051 flow, removed 64 selfloop flow, removed 12 redundant places.
[2024-11-08 16:47:55,624 INFO  L231             Difference]: Finished difference. Result has 96 places, 49 transitions, 346 flow
[2024-11-08 16:47:55,624 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=96, PETRI_TRANSITIONS=49}
[2024-11-08 16:47:55,625 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places.
[2024-11-08 16:47:55,625 INFO  L471      AbstractCegarLoop]: Abstraction has has 96 places, 49 transitions, 346 flow
[2024-11-08 16:47:55,625 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:55,625 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:55,625 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:55,625 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-11-08 16:47:55,625 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:55,626 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:55,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 1987513671, now seen corresponding path program 1 times
[2024-11-08 16:47:55,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:55,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835275081]
[2024-11-08 16:47:55,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:55,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:55,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:47:59,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:47:59,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 16:47:59,045 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835275081]
[2024-11-08 16:47:59,045 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835275081] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:47:59,045 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:47:59,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2024-11-08 16:47:59,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160943878]
[2024-11-08 16:47:59,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:47:59,045 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-11-08 16:47:59,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 16:47:59,046 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-11-08 16:47:59,046 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2024-11-08 16:47:59,051 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:47:59,051 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 49 transitions, 346 flow. Second operand  has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:59,051 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:47:59,051 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:47:59,051 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:47:59,786 INFO  L124   PetriNetUnfolderBase]: 643/1272 cut-off events.
[2024-11-08 16:47:59,786 INFO  L125   PetriNetUnfolderBase]: For 5826/6064 co-relation queries the response was YES.
[2024-11-08 16:47:59,790 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 1272 events. 643/1272 cut-off events. For 5826/6064 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7341 event pairs, 168 based on Foata normal form. 28/1189 useless extension candidates. Maximal degree in co-relation 5068. Up to 496 conditions per place. 
[2024-11-08 16:47:59,792 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 31 selfloop transitions, 3 changer transitions 27/81 dead transitions.
[2024-11-08 16:47:59,792 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 638 flow
[2024-11-08 16:47:59,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-08 16:47:59,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 16:47:59,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions.
[2024-11-08 16:47:59,793 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-11-08 16:47:59,793 INFO  L175             Difference]: Start difference. First operand has 96 places, 49 transitions, 346 flow. Second operand 8 states and 176 transitions.
[2024-11-08 16:47:59,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 638 flow
[2024-11-08 16:47:59,807 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 491 flow, removed 53 selfloop flow, removed 20 redundant places.
[2024-11-08 16:47:59,808 INFO  L231             Difference]: Finished difference. Result has 75 places, 44 transitions, 229 flow
[2024-11-08 16:47:59,808 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=75, PETRI_TRANSITIONS=44}
[2024-11-08 16:47:59,809 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places.
[2024-11-08 16:47:59,809 INFO  L471      AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 229 flow
[2024-11-08 16:47:59,809 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:47:59,810 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:47:59,810 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:47:59,810 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-11-08 16:47:59,810 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:47:59,810 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:47:59,811 INFO  L85        PathProgramCache]: Analyzing trace with hash -1558540633, now seen corresponding path program 2 times
[2024-11-08 16:47:59,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 16:47:59,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770106975]
[2024-11-08 16:47:59,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:47:59,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 16:47:59,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 16:47:59,915 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 16:48:00,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 16:48:00,084 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 16:48:00,084 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-08 16:48:00,085 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-08 16:48:00,087 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-08 16:48:00,088 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-08 16:48:00,088 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-08 16:48:00,088 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-08 16:48:00,088 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-08 16:48:00,088 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-08 16:48:00,089 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-11-08 16:48:00,089 INFO  L407         BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:00,160 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 16:48:00,161 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 16:48:00,166 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:48:00 BasicIcfg
[2024-11-08 16:48:00,166 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 16:48:00,167 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 16:48:00,167 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 16:48:00,167 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 16:48:00,168 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:11" (3/4) ...
[2024-11-08 16:48:00,170 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-08 16:48:00,171 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 16:48:00,172 INFO  L158              Benchmark]: Toolchain (without parser) took 50842.73ms. Allocated memory was 195.0MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 156.7MB in the beginning and 837.5MB in the end (delta: -680.8MB). Peak memory consumption was 315.9MB. Max. memory is 16.1GB.
[2024-11-08 16:48:00,172 INFO  L158              Benchmark]: CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 16:48:00,173 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 836.33ms. Allocated memory is still 195.0MB. Free memory was 156.7MB in the beginning and 127.9MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-11-08 16:48:00,173 INFO  L158              Benchmark]: Boogie Procedure Inliner took 79.42ms. Allocated memory is still 195.0MB. Free memory was 127.9MB in the beginning and 124.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 16:48:00,173 INFO  L158              Benchmark]: Boogie Preprocessor took 65.10ms. Allocated memory is still 195.0MB. Free memory was 124.7MB in the beginning and 120.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 16:48:00,174 INFO  L158              Benchmark]: RCFGBuilder took 1087.12ms. Allocated memory is still 195.0MB. Free memory was 120.0MB in the beginning and 97.6MB in the end (delta: 22.3MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB.
[2024-11-08 16:48:00,174 INFO  L158              Benchmark]: TraceAbstraction took 48761.90ms. Allocated memory was 195.0MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 97.6MB in the beginning and 838.5MB in the end (delta: -740.9MB). Peak memory consumption was 256.3MB. Max. memory is 16.1GB.
[2024-11-08 16:48:00,174 INFO  L158              Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 1.2GB. Free memory was 838.5MB in the beginning and 837.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 16:48:00,176 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 836.33ms. Allocated memory is still 195.0MB. Free memory was 156.7MB in the beginning and 127.9MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 79.42ms. Allocated memory is still 195.0MB. Free memory was 127.9MB in the beginning and 124.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 65.10ms. Allocated memory is still 195.0MB. Free memory was 124.7MB in the beginning and 120.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1087.12ms. Allocated memory is still 195.0MB. Free memory was 120.0MB in the beginning and 97.6MB in the end (delta: 22.3MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 48761.90ms. Allocated memory was 195.0MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 97.6MB in the beginning and 838.5MB in the end (delta: -740.9MB). Peak memory consumption was 256.3MB. Max. memory is 16.1GB.
 * Witness Printer took 4.50ms. Allocated memory is still 1.2GB. Free memory was 838.5MB in the beginning and 837.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 17. 
Possible FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p2_EAX = 0;
[L713]               0  int __unbuffered_p2_EBX = 0;
[L714]               0  _Bool main$tmp_guard0;
[L715]               0  _Bool main$tmp_guard1;
[L717]               0  int x = 0;
[L719]               0  int y = 0;
[L720]               0  _Bool y$flush_delayed;
[L721]               0  int y$mem_tmp;
[L722]               0  _Bool y$r_buff0_thd0;
[L723]               0  _Bool y$r_buff0_thd1;
[L724]               0  _Bool y$r_buff0_thd2;
[L725]               0  _Bool y$r_buff0_thd3;
[L726]               0  _Bool y$r_buff1_thd0;
[L727]               0  _Bool y$r_buff1_thd1;
[L728]               0  _Bool y$r_buff1_thd2;
[L729]               0  _Bool y$r_buff1_thd3;
[L730]               0  _Bool y$read_delayed;
[L731]               0  int *y$read_delayed_var;
[L732]               0  int y$w_buff0;
[L733]               0  _Bool y$w_buff0_used;
[L734]               0  int y$w_buff1;
[L735]               0  _Bool y$w_buff1_used;
[L736]               0  _Bool weak$$choice0;
[L737]               0  _Bool weak$$choice2;
[L844]               0  pthread_t t1873;
[L845]  FCALL, FORK  0  pthread_create(&t1873, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L846]               0  pthread_t t1874;
[L847]  FCALL, FORK  0  pthread_create(&t1874, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L848]               0  pthread_t t1875;
[L849]  FCALL, FORK  0  pthread_create(&t1875, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L741]               1  y$w_buff1 = y$w_buff0
[L742]               1  y$w_buff0 = 2
[L743]               1  y$w_buff1_used = y$w_buff0_used
[L744]               1  y$w_buff0_used = (_Bool)1
[L745]  CALL         1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   1  !(!expression)
[L745]  RET          1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L746]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L747]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L748]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L749]               1  y$r_buff1_thd3 = y$r_buff0_thd3
[L750]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L753]               1  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L770]               2  x = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L773]               2  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L776]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L777]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L778]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L779]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L780]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L790]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L791]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L792]               3  y$flush_delayed = weak$$choice2
[L793]               3  y$mem_tmp = y
[L794]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L795]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L796]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L797]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L798]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L800]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  __unbuffered_p2_EAX = y
[L802]               3  y = y$flush_delayed ? y$mem_tmp : y
[L803]               3  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L806]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L807]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L808]               3  y$flush_delayed = weak$$choice2
[L809]               3  y$mem_tmp = y
[L810]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L811]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L812]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L813]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L814]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L815]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L816]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]               3  __unbuffered_p2_EBX = y
[L818]               3  y = y$flush_delayed ? y$mem_tmp : y
[L819]               3  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L822]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L823]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L824]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L825]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L826]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L756]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L757]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L758]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L759]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L760]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L763]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L829]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L851]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L853]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L853]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L855]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L856]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L857]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L858]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L859]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L862]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L863]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L864]               0  y$flush_delayed = weak$$choice2
[L865]               0  y$mem_tmp = y
[L866]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L867]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L868]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L869]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L870]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L871]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L872]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L874]               0  y = y$flush_delayed ? y$mem_tmp : y
[L875]               0  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L877]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
[L18]   CALL         0  reach_error()
[L17]   COND FALSE   0  !(0)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L17]                0  __assert_fail ("0", "safe004_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]

  - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 48.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1303 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1270 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4526 IncrementalHoareTripleChecker+Invalid, 4781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 50 mSDtfsCounter, 4526 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=13, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 5196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-08 16:48:00,215 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 16:48:02,709 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 16:48:02,822 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-08 16:48:02,830 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 16:48:02,831 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 16:48:02,863 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 16:48:02,864 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 16:48:02,864 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 16:48:02,865 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 16:48:02,865 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 16:48:02,866 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 16:48:02,866 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 16:48:02,867 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 16:48:02,870 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 16:48:02,870 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 16:48:02,871 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 16:48:02,871 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 16:48:02,871 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 16:48:02,872 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 16:48:02,872 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 16:48:02,872 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2024-11-08 16:48:02,876 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2024-11-08 16:48:02,877 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2024-11-08 16:48:02,877 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 16:48:02,877 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-08 16:48:02,877 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-08 16:48:02,878 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 16:48:02,878 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 16:48:02,878 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-08 16:48:02,878 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 16:48:02,879 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 16:48:02,879 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 16:48:02,879 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 16:48:02,880 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 16:48:02,880 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 16:48:02,881 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:48:02,882 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 16:48:02,882 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 16:48:02,882 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2024-11-08 16:48:02,883 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 16:48:02,884 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 16:48:02,884 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 16:48:02,884 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 16:48:02,884 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 16:48:02,885 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3
[2024-11-08 16:48:03,326 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 16:48:03,387 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 16:48:03,391 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 16:48:03,392 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 16:48:03,394 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 16:48:03,396 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
Unable to find full path for "g++"
[2024-11-08 16:48:05,472 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 16:48:05,766 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 16:48:05,766 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-08 16:48:05,795 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/data/9c4b53886/4d28856d3d344d4ebe92b35c5e119e90/FLAG3fb2e3ea7
[2024-11-08 16:48:06,038 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/data/9c4b53886/4d28856d3d344d4ebe92b35c5e119e90
[2024-11-08 16:48:06,040 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 16:48:06,042 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 16:48:06,043 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 16:48:06,044 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 16:48:06,051 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 16:48:06,052 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:06,053 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4bf7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06, skipping insertion in model container
[2024-11-08 16:48:06,054 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:06,109 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 16:48:06,732 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:48:06,752 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 16:48:06,853 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 16:48:06,905 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 16:48:06,906 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06 WrapperNode
[2024-11-08 16:48:06,906 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 16:48:06,908 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 16:48:06,908 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 16:48:06,908 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 16:48:06,916 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:06,947 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:06,994 INFO  L138                Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138
[2024-11-08 16:48:06,999 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 16:48:06,999 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 16:48:07,000 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 16:48:07,000 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 16:48:07,012 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,017 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,024 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,053 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 16:48:07,056 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,057 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,081 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,083 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,086 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,088 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,092 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 16:48:07,093 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 16:48:07,093 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 16:48:07,093 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 16:48:07,094 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (1/1) ...
[2024-11-08 16:48:07,100 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 16:48:07,114 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:07,127 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 16:48:07,134 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 16:48:07,162 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 16:48:07,162 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 16:48:07,162 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 16:48:07,162 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-08 16:48:07,163 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-08 16:48:07,163 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-08 16:48:07,163 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-08 16:48:07,163 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-11-08 16:48:07,165 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-11-08 16:48:07,165 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 16:48:07,165 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 16:48:07,166 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 16:48:07,168 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-08 16:48:07,344 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 16:48:07,346 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 16:48:07,854 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 16:48:07,854 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 16:48:08,224 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 16:48:08,225 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 16:48:08,226 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:48:08 BoogieIcfgContainer
[2024-11-08 16:48:08,227 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 16:48:08,229 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 16:48:08,230 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 16:48:08,234 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 16:48:08,234 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:48:06" (1/3) ...
[2024-11-08 16:48:08,236 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69212c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:48:08, skipping insertion in model container
[2024-11-08 16:48:08,236 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:48:06" (2/3) ...
[2024-11-08 16:48:08,238 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69212c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:48:08, skipping insertion in model container
[2024-11-08 16:48:08,238 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:48:08" (3/3) ...
[2024-11-08 16:48:08,239 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-08 16:48:08,260 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 16:48:08,260 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-08 16:48:08,260 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 16:48:08,349 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 16:48:08,394 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow
[2024-11-08 16:48:08,430 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-11-08 16:48:08,431 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 16:48:08,436 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. 
[2024-11-08 16:48:08,436 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow
[2024-11-08 16:48:08,440 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow
[2024-11-08 16:48:08,450 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 16:48:08,456 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2295c178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 16:48:08,457 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-08 16:48:08,462 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 16:48:08,462 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-08 16:48:08,463 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 16:48:08,463 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:08,464 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-08 16:48:08,465 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:08,470 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:08,471 INFO  L85        PathProgramCache]: Analyzing trace with hash 14280030, now seen corresponding path program 1 times
[2024-11-08 16:48:08,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:08,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739845595]
[2024-11-08 16:48:08,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:48:08,486 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:08,486 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:08,488 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:08,491 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 16:48:08,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:48:08,654 INFO  L255         TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:08,661 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:08,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:08,701 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:08,702 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:08,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739845595]
[2024-11-08 16:48:08,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739845595] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:08,703 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:08,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 16:48:08,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221151882]
[2024-11-08 16:48:08,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:08,716 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:48:08,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:08,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:48:08,753 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:48:08,755 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44
[2024-11-08 16:48:08,758 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:08,759 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:08,759 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44
[2024-11-08 16:48:08,760 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:09,617 INFO  L124   PetriNetUnfolderBase]: 1178/2120 cut-off events.
[2024-11-08 16:48:09,617 INFO  L125   PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES.
[2024-11-08 16:48:09,628 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 2120 events. 1178/2120 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14211 event pairs, 188 based on Foata normal form. 120/2232 useless extension candidates. Maximal degree in co-relation 3899. Up to 1420 conditions per place. 
[2024-11-08 16:48:09,643 INFO  L140   encePairwiseOnDemand]: 39/44 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions.
[2024-11-08 16:48:09,643 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 207 flow
[2024-11-08 16:48:09,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 16:48:09,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 16:48:09,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions.
[2024-11-08 16:48:09,659 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.7348484848484849
[2024-11-08 16:48:09,661 INFO  L175             Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions.
[2024-11-08 16:48:09,662 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 207 flow
[2024-11-08 16:48:09,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-08 16:48:09,670 INFO  L231             Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow
[2024-11-08 16:48:09,672 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36}
[2024-11-08 16:48:09,678 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places.
[2024-11-08 16:48:09,678 INFO  L471      AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow
[2024-11-08 16:48:09,679 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:09,679 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:09,679 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:09,702 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 16:48:09,884 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:09,885 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:09,886 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:09,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 1140311638, now seen corresponding path program 1 times
[2024-11-08 16:48:09,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:09,889 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991885720]
[2024-11-08 16:48:09,891 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:48:09,891 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:09,891 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:09,894 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:09,898 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 16:48:10,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:48:10,026 INFO  L255         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:10,027 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:10,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:10,096 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:10,096 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:10,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991885720]
[2024-11-08 16:48:10,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991885720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:10,097 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:10,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 16:48:10,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822374929]
[2024-11-08 16:48:10,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:10,098 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 16:48:10,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:10,099 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 16:48:10,100 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 16:48:10,101 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-08 16:48:10,102 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:10,102 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:10,103 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-08 16:48:10,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:10,591 INFO  L124   PetriNetUnfolderBase]: 1045/1829 cut-off events.
[2024-11-08 16:48:10,591 INFO  L125   PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES.
[2024-11-08 16:48:10,595 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 1829 events. 1045/1829 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11565 event pairs, 1045 based on Foata normal form. 60/1862 useless extension candidates. Maximal degree in co-relation 3543. Up to 1558 conditions per place. 
[2024-11-08 16:48:10,607 INFO  L140   encePairwiseOnDemand]: 42/44 looper letters, 20 selfloop transitions, 1 changer transitions 1/35 dead transitions.
[2024-11-08 16:48:10,608 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 124 flow
[2024-11-08 16:48:10,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 16:48:10,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 16:48:10,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-11-08 16:48:10,611 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5378787878787878
[2024-11-08 16:48:10,611 INFO  L175             Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 71 transitions.
[2024-11-08 16:48:10,611 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 124 flow
[2024-11-08 16:48:10,612 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 16:48:10,613 INFO  L231             Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow
[2024-11-08 16:48:10,613 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34}
[2024-11-08 16:48:10,614 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places.
[2024-11-08 16:48:10,615 INFO  L471      AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow
[2024-11-08 16:48:10,616 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:10,617 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:10,617 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:10,639 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 16:48:10,818 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:10,820 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:10,821 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:10,821 INFO  L85        PathProgramCache]: Analyzing trace with hash 1140313130, now seen corresponding path program 1 times
[2024-11-08 16:48:10,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:10,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836859943]
[2024-11-08 16:48:10,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:48:10,822 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:10,823 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:10,825 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:10,827 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 16:48:10,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:48:10,955 INFO  L255         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:10,957 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:11,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:11,012 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:11,012 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:11,013 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836859943]
[2024-11-08 16:48:11,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836859943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:11,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:11,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 16:48:11,014 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930443843]
[2024-11-08 16:48:11,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:11,014 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 16:48:11,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:11,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 16:48:11,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 16:48:11,028 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-11-08 16:48:11,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand  has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:11,029 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:11,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-11-08 16:48:11,030 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:11,772 INFO  L124   PetriNetUnfolderBase]: 1997/3289 cut-off events.
[2024-11-08 16:48:11,773 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 16:48:11,778 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6329 conditions, 3289 events. 1997/3289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20004 event pairs, 227 based on Foata normal form. 120/3399 useless extension candidates. Maximal degree in co-relation 6323. Up to 1861 conditions per place. 
[2024-11-08 16:48:11,791 INFO  L140   encePairwiseOnDemand]: 38/44 looper letters, 46 selfloop transitions, 5 changer transitions 1/61 dead transitions.
[2024-11-08 16:48:11,791 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 238 flow
[2024-11-08 16:48:11,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 16:48:11,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-08 16:48:11,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions.
[2024-11-08 16:48:11,794 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.6022727272727273
[2024-11-08 16:48:11,795 INFO  L175             Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 106 transitions.
[2024-11-08 16:48:11,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 238 flow
[2024-11-08 16:48:11,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 16:48:11,800 INFO  L231             Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow
[2024-11-08 16:48:11,800 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37}
[2024-11-08 16:48:11,801 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places.
[2024-11-08 16:48:11,801 INFO  L471      AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow
[2024-11-08 16:48:11,801 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:11,802 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:11,802 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:11,823 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-08 16:48:12,002 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:12,003 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:12,003 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:12,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -634177725, now seen corresponding path program 1 times
[2024-11-08 16:48:12,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:12,004 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356961220]
[2024-11-08 16:48:12,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:48:12,005 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:12,005 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:12,007 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:12,008 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 16:48:12,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:48:12,125 INFO  L255         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:12,126 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:12,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:12,195 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:12,195 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:12,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356961220]
[2024-11-08 16:48:12,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [356961220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:12,196 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:12,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 16:48:12,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040342517]
[2024-11-08 16:48:12,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:12,197 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 16:48:12,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:12,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 16:48:12,198 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 16:48:12,206 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-11-08 16:48:12,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:12,207 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:12,208 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-11-08 16:48:12,208 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:12,790 INFO  L124   PetriNetUnfolderBase]: 1197/1997 cut-off events.
[2024-11-08 16:48:12,791 INFO  L125   PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES.
[2024-11-08 16:48:12,797 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4536 conditions, 1997 events. 1197/1997 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10641 event pairs, 125 based on Foata normal form. 96/2083 useless extension candidates. Maximal degree in co-relation 4527. Up to 769 conditions per place. 
[2024-11-08 16:48:12,807 INFO  L140   encePairwiseOnDemand]: 38/44 looper letters, 58 selfloop transitions, 8 changer transitions 1/76 dead transitions.
[2024-11-08 16:48:12,808 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 342 flow
[2024-11-08 16:48:12,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-08 16:48:12,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 16:48:12,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions.
[2024-11-08 16:48:12,813 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.6090909090909091
[2024-11-08 16:48:12,814 INFO  L175             Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 134 transitions.
[2024-11-08 16:48:12,814 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 342 flow
[2024-11-08 16:48:12,817 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-08 16:48:12,820 INFO  L231             Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow
[2024-11-08 16:48:12,820 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40}
[2024-11-08 16:48:12,821 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places.
[2024-11-08 16:48:12,822 INFO  L471      AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow
[2024-11-08 16:48:12,823 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:12,823 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:12,823 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:12,843 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 16:48:13,024 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:13,024 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:13,025 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:13,025 INFO  L85        PathProgramCache]: Analyzing trace with hash -632798805, now seen corresponding path program 1 times
[2024-11-08 16:48:13,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:13,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716522283]
[2024-11-08 16:48:13,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:48:13,026 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:13,026 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:13,027 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:13,029 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-08 16:48:13,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:48:13,156 INFO  L255         TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:13,158 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:13,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:13,250 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:13,250 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:13,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716522283]
[2024-11-08 16:48:13,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [716522283] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:13,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:13,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 16:48:13,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120276037]
[2024-11-08 16:48:13,256 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:13,257 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:48:13,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:13,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:48:13,258 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:48:13,269 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-11-08 16:48:13,269 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand  has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:13,270 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:13,271 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-11-08 16:48:13,271 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:13,783 INFO  L124   PetriNetUnfolderBase]: 671/1095 cut-off events.
[2024-11-08 16:48:13,783 INFO  L125   PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES.
[2024-11-08 16:48:13,787 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2826 conditions, 1095 events. 671/1095 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5020 event pairs, 105 based on Foata normal form. 44/1129 useless extension candidates. Maximal degree in co-relation 2815. Up to 352 conditions per place. 
[2024-11-08 16:48:13,793 INFO  L140   encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 11 changer transitions 1/71 dead transitions.
[2024-11-08 16:48:13,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 345 flow
[2024-11-08 16:48:13,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-08 16:48:13,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 16:48:13,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions.
[2024-11-08 16:48:13,795 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5378787878787878
[2024-11-08 16:48:13,796 INFO  L175             Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 142 transitions.
[2024-11-08 16:48:13,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 345 flow
[2024-11-08 16:48:13,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 320 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-08 16:48:13,803 INFO  L231             Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow
[2024-11-08 16:48:13,803 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40}
[2024-11-08 16:48:13,804 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places.
[2024-11-08 16:48:13,805 INFO  L471      AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow
[2024-11-08 16:48:13,805 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:13,805 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:13,805 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:13,825 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-08 16:48:14,006 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:14,007 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:14,007 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:14,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -811563221, now seen corresponding path program 1 times
[2024-11-08 16:48:14,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:14,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [169896040]
[2024-11-08 16:48:14,010 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 16:48:14,011 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:14,011 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:14,013 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:14,015 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-08 16:48:14,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 16:48:14,158 INFO  L255         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:14,166 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:15,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:15,244 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:15,245 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:15,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169896040]
[2024-11-08 16:48:15,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [169896040] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:15,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:15,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-08 16:48:15,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516672934]
[2024-11-08 16:48:15,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:15,248 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 16:48:15,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:15,249 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 16:48:15,249 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-11-08 16:48:15,281 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-11-08 16:48:15,282 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand  has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:15,282 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:15,282 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-11-08 16:48:15,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:16,201 INFO  L124   PetriNetUnfolderBase]: 1135/1808 cut-off events.
[2024-11-08 16:48:16,201 INFO  L125   PetriNetUnfolderBase]: For 1452/1452 co-relation queries the response was YES.
[2024-11-08 16:48:16,208 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4746 conditions, 1808 events. 1135/1808 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8280 event pairs, 157 based on Foata normal form. 8/1812 useless extension candidates. Maximal degree in co-relation 4734. Up to 999 conditions per place. 
[2024-11-08 16:48:16,216 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 64 selfloop transitions, 27 changer transitions 17/116 dead transitions.
[2024-11-08 16:48:16,217 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 617 flow
[2024-11-08 16:48:16,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-11-08 16:48:16,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-11-08 16:48:16,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 238 transitions.
[2024-11-08 16:48:16,219 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.49173553719008267
[2024-11-08 16:48:16,219 INFO  L175             Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 11 states and 238 transitions.
[2024-11-08 16:48:16,219 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 617 flow
[2024-11-08 16:48:16,237 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 116 transitions, 504 flow, removed 20 selfloop flow, removed 8 redundant places.
[2024-11-08 16:48:16,239 INFO  L231             Difference]: Finished difference. Result has 62 places, 66 transitions, 285 flow
[2024-11-08 16:48:16,240 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=285, PETRI_PLACES=62, PETRI_TRANSITIONS=66}
[2024-11-08 16:48:16,241 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places.
[2024-11-08 16:48:16,241 INFO  L471      AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 285 flow
[2024-11-08 16:48:16,243 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:16,243 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:16,243 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:16,265 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-11-08 16:48:16,444 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:16,444 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:16,445 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:16,445 INFO  L85        PathProgramCache]: Analyzing trace with hash 2144283367, now seen corresponding path program 2 times
[2024-11-08 16:48:16,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:16,447 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [759250746]
[2024-11-08 16:48:16,447 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 16:48:16,447 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:16,447 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:16,451 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:16,452 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-08 16:48:16,580 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-08 16:48:16,580 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 16:48:16,583 INFO  L255         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 21 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:16,587 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:17,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:17,145 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:17,145 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:17,145 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759250746]
[2024-11-08 16:48:17,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [759250746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:17,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:17,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:48:17,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456516267]
[2024-11-08 16:48:17,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:17,146 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 16:48:17,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:17,147 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 16:48:17,147 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:48:17,175 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-11-08 16:48:17,175 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 285 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:17,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:17,176 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-11-08 16:48:17,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:18,045 INFO  L124   PetriNetUnfolderBase]: 1990/3157 cut-off events.
[2024-11-08 16:48:18,045 INFO  L125   PetriNetUnfolderBase]: For 1827/1827 co-relation queries the response was YES.
[2024-11-08 16:48:18,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8994 conditions, 3157 events. 1990/3157 cut-off events. For 1827/1827 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16438 event pairs, 235 based on Foata normal form. 8/3163 useless extension candidates. Maximal degree in co-relation 8980. Up to 1584 conditions per place. 
[2024-11-08 16:48:18,068 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 97 selfloop transitions, 15 changer transitions 29/149 dead transitions.
[2024-11-08 16:48:18,068 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 149 transitions, 901 flow
[2024-11-08 16:48:18,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-08 16:48:18,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 16:48:18,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions.
[2024-11-08 16:48:18,070 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.53125
[2024-11-08 16:48:18,070 INFO  L175             Difference]: Start difference. First operand has 62 places, 66 transitions, 285 flow. Second operand 8 states and 187 transitions.
[2024-11-08 16:48:18,070 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 149 transitions, 901 flow
[2024-11-08 16:48:18,083 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 149 transitions, 876 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-08 16:48:18,085 INFO  L231             Difference]: Finished difference. Result has 66 places, 77 transitions, 388 flow
[2024-11-08 16:48:18,085 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=388, PETRI_PLACES=66, PETRI_TRANSITIONS=77}
[2024-11-08 16:48:18,086 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places.
[2024-11-08 16:48:18,086 INFO  L471      AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 388 flow
[2024-11-08 16:48:18,086 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:18,087 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:18,087 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:18,111 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-08 16:48:18,287 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:18,288 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:18,291 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:18,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 1727274291, now seen corresponding path program 3 times
[2024-11-08 16:48:18,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:18,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960601682]
[2024-11-08 16:48:18,293 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 16:48:18,293 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:18,293 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:18,296 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:18,297 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-08 16:48:18,420 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-08 16:48:18,420 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 16:48:18,422 INFO  L255         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:18,426 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:19,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:19,164 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:19,164 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:19,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960601682]
[2024-11-08 16:48:19,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960601682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:19,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:19,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-08 16:48:19,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949886401]
[2024-11-08 16:48:19,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:19,165 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 16:48:19,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:19,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 16:48:19,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-11-08 16:48:19,198 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-11-08 16:48:19,198 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 388 flow. Second operand  has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:19,199 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:19,199 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-11-08 16:48:19,199 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:20,436 INFO  L124   PetriNetUnfolderBase]: 2392/3815 cut-off events.
[2024-11-08 16:48:20,436 INFO  L125   PetriNetUnfolderBase]: For 2626/2626 co-relation queries the response was YES.
[2024-11-08 16:48:20,452 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11402 conditions, 3815 events. 2392/3815 cut-off events. For 2626/2626 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20610 event pairs, 161 based on Foata normal form. 8/3819 useless extension candidates. Maximal degree in co-relation 11386. Up to 928 conditions per place. 
[2024-11-08 16:48:20,465 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 79 selfloop transitions, 42 changer transitions 26/155 dead transitions.
[2024-11-08 16:48:20,465 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 155 transitions, 959 flow
[2024-11-08 16:48:20,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-11-08 16:48:20,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-11-08 16:48:20,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 278 transitions.
[2024-11-08 16:48:20,468 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.486013986013986
[2024-11-08 16:48:20,468 INFO  L175             Difference]: Start difference. First operand has 66 places, 77 transitions, 388 flow. Second operand 13 states and 278 transitions.
[2024-11-08 16:48:20,468 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 155 transitions, 959 flow
[2024-11-08 16:48:20,474 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 155 transitions, 948 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-11-08 16:48:20,477 INFO  L231             Difference]: Finished difference. Result has 80 places, 84 transitions, 569 flow
[2024-11-08 16:48:20,477 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=569, PETRI_PLACES=80, PETRI_TRANSITIONS=84}
[2024-11-08 16:48:20,478 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places.
[2024-11-08 16:48:20,478 INFO  L471      AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 569 flow
[2024-11-08 16:48:20,478 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:20,479 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:20,479 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:20,501 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-08 16:48:20,679 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:20,680 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:20,680 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:20,680 INFO  L85        PathProgramCache]: Analyzing trace with hash -558503161, now seen corresponding path program 4 times
[2024-11-08 16:48:20,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:20,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52215248]
[2024-11-08 16:48:20,681 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 16:48:20,681 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:20,681 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:20,687 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:20,689 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-08 16:48:20,810 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 16:48:20,810 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 16:48:20,812 INFO  L255         TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:20,815 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:21,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:21,215 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:21,215 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:21,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52215248]
[2024-11-08 16:48:21,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [52215248] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:21,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:21,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-08 16:48:21,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490610854]
[2024-11-08 16:48:21,217 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:21,217 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 16:48:21,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:21,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 16:48:21,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:48:21,231 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:48:21,231 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 569 flow. Second operand  has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:21,231 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:21,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:48:21,232 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:22,330 INFO  L124   PetriNetUnfolderBase]: 2891/5218 cut-off events.
[2024-11-08 16:48:22,330 INFO  L125   PetriNetUnfolderBase]: For 9295/9350 co-relation queries the response was YES.
[2024-11-08 16:48:22,356 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17480 conditions, 5218 events. 2891/5218 cut-off events. For 9295/9350 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 36734 event pairs, 662 based on Foata normal form. 36/5057 useless extension candidates. Maximal degree in co-relation 17458. Up to 1750 conditions per place. 
[2024-11-08 16:48:22,371 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 80 selfloop transitions, 37 changer transitions 29/176 dead transitions.
[2024-11-08 16:48:22,371 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 176 transitions, 1323 flow
[2024-11-08 16:48:22,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-08 16:48:22,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 16:48:22,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions.
[2024-11-08 16:48:22,373 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5852272727272727
[2024-11-08 16:48:22,373 INFO  L175             Difference]: Start difference. First operand has 80 places, 84 transitions, 569 flow. Second operand 8 states and 206 transitions.
[2024-11-08 16:48:22,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 176 transitions, 1323 flow
[2024-11-08 16:48:22,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 176 transitions, 1234 flow, removed 11 selfloop flow, removed 9 redundant places.
[2024-11-08 16:48:22,481 INFO  L231             Difference]: Finished difference. Result has 80 places, 107 transitions, 815 flow
[2024-11-08 16:48:22,481 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=815, PETRI_PLACES=80, PETRI_TRANSITIONS=107}
[2024-11-08 16:48:22,482 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places.
[2024-11-08 16:48:22,482 INFO  L471      AbstractCegarLoop]: Abstraction has has 80 places, 107 transitions, 815 flow
[2024-11-08 16:48:22,482 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:22,483 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:22,483 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:22,496 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-11-08 16:48:22,683 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:22,683 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:22,684 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:22,684 INFO  L85        PathProgramCache]: Analyzing trace with hash 35994309, now seen corresponding path program 5 times
[2024-11-08 16:48:22,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:22,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901356820]
[2024-11-08 16:48:22,685 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-08 16:48:22,685 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:22,685 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:22,688 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:22,690 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-08 16:48:22,835 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-08 16:48:22,835 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 16:48:22,837 INFO  L255         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:22,840 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:23,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:23,142 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:23,142 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:23,142 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901356820]
[2024-11-08 16:48:23,143 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [901356820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:23,143 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:23,143 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 16:48:23,143 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44585286]
[2024-11-08 16:48:23,143 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:23,144 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 16:48:23,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:23,144 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 16:48:23,145 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-08 16:48:23,164 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-08 16:48:23,164 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 107 transitions, 815 flow. Second operand  has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:23,164 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:23,164 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-08 16:48:23,165 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:24,755 INFO  L124   PetriNetUnfolderBase]: 3833/7106 cut-off events.
[2024-11-08 16:48:24,755 INFO  L125   PetriNetUnfolderBase]: For 14623/14690 co-relation queries the response was YES.
[2024-11-08 16:48:24,801 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24902 conditions, 7106 events. 3833/7106 cut-off events. For 14623/14690 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 55387 event pairs, 1315 based on Foata normal form. 47/6855 useless extension candidates. Maximal degree in co-relation 24878. Up to 3000 conditions per place. 
[2024-11-08 16:48:24,817 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 67 selfloop transitions, 41 changer transitions 66/203 dead transitions.
[2024-11-08 16:48:24,817 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 203 transitions, 1742 flow
[2024-11-08 16:48:24,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-08 16:48:24,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-08 16:48:24,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 232 transitions.
[2024-11-08 16:48:24,819 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5272727272727272
[2024-11-08 16:48:24,819 INFO  L175             Difference]: Start difference. First operand has 80 places, 107 transitions, 815 flow. Second operand 10 states and 232 transitions.
[2024-11-08 16:48:24,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 203 transitions, 1742 flow
[2024-11-08 16:48:24,959 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 203 transitions, 1732 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-11-08 16:48:24,962 INFO  L231             Difference]: Finished difference. Result has 91 places, 116 transitions, 1044 flow
[2024-11-08 16:48:24,962 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1044, PETRI_PLACES=91, PETRI_TRANSITIONS=116}
[2024-11-08 16:48:24,963 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 42 predicate places.
[2024-11-08 16:48:24,963 INFO  L471      AbstractCegarLoop]: Abstraction has has 91 places, 116 transitions, 1044 flow
[2024-11-08 16:48:24,964 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:24,964 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:24,964 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:24,980 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-11-08 16:48:25,167 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:25,168 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:25,168 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:25,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 619053611, now seen corresponding path program 6 times
[2024-11-08 16:48:25,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:25,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132354557]
[2024-11-08 16:48:25,169 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-08 16:48:25,169 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:25,169 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:25,170 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:25,171 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-11-08 16:48:25,281 INFO  L227   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2024-11-08 16:48:25,281 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 16:48:25,283 INFO  L255         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 16:48:25,285 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 16:48:25,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 16:48:25,371 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 16:48:25,371 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 16:48:25,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132354557]
[2024-11-08 16:48:25,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132354557] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 16:48:25,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 16:48:25,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 16:48:25,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964491225]
[2024-11-08 16:48:25,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 16:48:25,372 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 16:48:25,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 16:48:25,373 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 16:48:25,373 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 16:48:25,386 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-11-08 16:48:25,387 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 116 transitions, 1044 flow. Second operand  has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:25,387 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 16:48:25,387 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-11-08 16:48:25,387 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 16:48:26,559 INFO  L124   PetriNetUnfolderBase]: 4770/8743 cut-off events.
[2024-11-08 16:48:26,560 INFO  L125   PetriNetUnfolderBase]: For 24021/24157 co-relation queries the response was YES.
[2024-11-08 16:48:26,598 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31958 conditions, 8743 events. 4770/8743 cut-off events. For 24021/24157 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 69479 event pairs, 1767 based on Foata normal form. 126/8402 useless extension candidates. Maximal degree in co-relation 31928. Up to 3506 conditions per place. 
[2024-11-08 16:48:26,610 INFO  L140   encePairwiseOnDemand]: 38/44 looper letters, 60 selfloop transitions, 2 changer transitions 96/185 dead transitions.
[2024-11-08 16:48:26,610 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 185 transitions, 1907 flow
[2024-11-08 16:48:26,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-08 16:48:26,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 16:48:26,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions.
[2024-11-08 16:48:26,612 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5189393939393939
[2024-11-08 16:48:26,612 INFO  L175             Difference]: Start difference. First operand has 91 places, 116 transitions, 1044 flow. Second operand 6 states and 137 transitions.
[2024-11-08 16:48:26,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 185 transitions, 1907 flow
[2024-11-08 16:48:26,873 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 185 transitions, 1888 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-08 16:48:26,876 INFO  L231             Difference]: Finished difference. Result has 90 places, 81 transitions, 650 flow
[2024-11-08 16:48:26,876 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=650, PETRI_PLACES=90, PETRI_TRANSITIONS=81}
[2024-11-08 16:48:26,877 INFO  L277   CegarLoopForPetriNet]: 49 programPoint places, 41 predicate places.
[2024-11-08 16:48:26,877 INFO  L471      AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 650 flow
[2024-11-08 16:48:26,878 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 16:48:26,878 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 16:48:26,878 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 16:48:26,899 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2024-11-08 16:48:27,078 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:27,079 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 16:48:27,079 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 16:48:27,079 INFO  L85        PathProgramCache]: Analyzing trace with hash -1140928203, now seen corresponding path program 7 times
[2024-11-08 16:48:27,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 16:48:27,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723458289]
[2024-11-08 16:48:27,080 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-08 16:48:27,080 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:27,080 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 16:48:27,081 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 16:48:27,082 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-11-08 16:48:27,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 16:48:27,191 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 16:48:27,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 16:48:27,289 INFO  L130   FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-11-08 16:48:27,290 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-08 16:48:27,291 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-08 16:48:27,292 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-08 16:48:27,293 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-08 16:48:27,293 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-08 16:48:27,293 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-08 16:48:27,293 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-08 16:48:27,294 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-08 16:48:27,315 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2024-11-08 16:48:27,494 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 16:48:27,495 INFO  L407         BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1]
[2024-11-08 16:48:27,568 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 16:48:27,568 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 16:48:27,577 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:48:27 BasicIcfg
[2024-11-08 16:48:27,577 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 16:48:27,578 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 16:48:27,578 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 16:48:27,581 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 16:48:27,581 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:48:08" (3/4) ...
[2024-11-08 16:48:27,584 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-08 16:48:27,585 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 16:48:27,586 INFO  L158              Benchmark]: Toolchain (without parser) took 21544.42ms. Allocated memory was 65.0MB in the beginning and 578.8MB in the end (delta: 513.8MB). Free memory was 39.9MB in the beginning and 215.9MB in the end (delta: -176.0MB). Peak memory consumption was 339.0MB. Max. memory is 16.1GB.
[2024-11-08 16:48:27,587 INFO  L158              Benchmark]: CDTParser took 1.65ms. Allocated memory is still 65.0MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 16:48:27,587 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 863.56ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 39.7MB in the beginning and 49.0MB in the end (delta: -9.2MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB.
[2024-11-08 16:48:27,587 INFO  L158              Benchmark]: Boogie Procedure Inliner took 91.36ms. Allocated memory is still 88.1MB. Free memory was 49.0MB in the beginning and 46.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 16:48:27,588 INFO  L158              Benchmark]: Boogie Preprocessor took 92.89ms. Allocated memory is still 88.1MB. Free memory was 46.2MB in the beginning and 64.7MB in the end (delta: -18.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB.
[2024-11-08 16:48:27,588 INFO  L158              Benchmark]: RCFGBuilder took 1133.84ms. Allocated memory is still 88.1MB. Free memory was 64.7MB in the beginning and 48.2MB in the end (delta: 16.5MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB.
[2024-11-08 16:48:27,590 INFO  L158              Benchmark]: TraceAbstraction took 19348.91ms. Allocated memory was 88.1MB in the beginning and 578.8MB in the end (delta: 490.7MB). Free memory was 47.7MB in the beginning and 216.9MB in the end (delta: -169.2MB). Peak memory consumption was 320.0MB. Max. memory is 16.1GB.
[2024-11-08 16:48:27,590 INFO  L158              Benchmark]: Witness Printer took 7.61ms. Allocated memory is still 578.8MB. Free memory is still 215.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 16:48:27,592 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 1.65ms. Allocated memory is still 65.0MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 863.56ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 39.7MB in the beginning and 49.0MB in the end (delta: -9.2MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 91.36ms. Allocated memory is still 88.1MB. Free memory was 49.0MB in the beginning and 46.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 92.89ms. Allocated memory is still 88.1MB. Free memory was 46.2MB in the beginning and 64.7MB in the end (delta: -18.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1133.84ms. Allocated memory is still 88.1MB. Free memory was 64.7MB in the beginning and 48.2MB in the end (delta: 16.5MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 19348.91ms. Allocated memory was 88.1MB in the beginning and 578.8MB in the end (delta: 490.7MB). Free memory was 47.7MB in the beginning and 216.9MB in the end (delta: -169.2MB). Peak memory consumption was 320.0MB. Max. memory is 16.1GB.
 * Witness Printer took 7.61ms. Allocated memory is still 578.8MB. Free memory is still 215.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 17. 
Possible FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p2_EAX = 0;
[L713]               0  int __unbuffered_p2_EBX = 0;
[L714]               0  _Bool main$tmp_guard0;
[L715]               0  _Bool main$tmp_guard1;
[L717]               0  int x = 0;
[L719]               0  int y = 0;
[L720]               0  _Bool y$flush_delayed;
[L721]               0  int y$mem_tmp;
[L722]               0  _Bool y$r_buff0_thd0;
[L723]               0  _Bool y$r_buff0_thd1;
[L724]               0  _Bool y$r_buff0_thd2;
[L725]               0  _Bool y$r_buff0_thd3;
[L726]               0  _Bool y$r_buff1_thd0;
[L727]               0  _Bool y$r_buff1_thd1;
[L728]               0  _Bool y$r_buff1_thd2;
[L729]               0  _Bool y$r_buff1_thd3;
[L730]               0  _Bool y$read_delayed;
[L731]               0  int *y$read_delayed_var;
[L732]               0  int y$w_buff0;
[L733]               0  _Bool y$w_buff0_used;
[L734]               0  int y$w_buff1;
[L735]               0  _Bool y$w_buff1_used;
[L736]               0  _Bool weak$$choice0;
[L737]               0  _Bool weak$$choice2;
[L844]               0  pthread_t t1873;
[L845]  FCALL, FORK  0  pthread_create(&t1873, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=131069, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L741]               1  y$w_buff1 = y$w_buff0
[L742]               1  y$w_buff0 = 2
[L743]               1  y$w_buff1_used = y$w_buff0_used
[L744]               1  y$w_buff0_used = (_Bool)1
[L745]  CALL         1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   1  !(!expression)
[L745]  RET          1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L746]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L747]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L748]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L749]               1  y$r_buff1_thd3 = y$r_buff0_thd3
[L750]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L846]               0  pthread_t t1874;
[L847]  FCALL, FORK  0  pthread_create(&t1874, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=131069, t1874=131070, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L848]               0  pthread_t t1875;
[L753]               1  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L770]               2  x = 2
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L773]               2  y = 1
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L776]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L777]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L778]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L779]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L780]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L849]  FCALL, FORK  0  pthread_create(&t1875, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873=131069, t1874=131070, t1875=131071, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L790]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L791]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L792]               3  y$flush_delayed = weak$$choice2
[L793]               3  y$mem_tmp = y
[L794]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L795]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L796]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L797]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L798]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L800]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  __unbuffered_p2_EAX = y
[L802]               3  y = y$flush_delayed ? y$mem_tmp : y
[L803]               3  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L806]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L807]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L808]               3  y$flush_delayed = weak$$choice2
[L809]               3  y$mem_tmp = y
[L810]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L811]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L812]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L813]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L814]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L815]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L816]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]               3  __unbuffered_p2_EBX = y
[L818]               3  y = y$flush_delayed ? y$mem_tmp : y
[L819]               3  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L822]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L823]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L824]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L825]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L826]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L756]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L757]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L758]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L759]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L760]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L763]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L829]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L851]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=131069, t1874=131070, t1875=131071, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L853]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L853]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L855]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L856]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L857]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L858]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L859]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=131069, t1874=131070, t1875=131071, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L862]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L863]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L864]               0  y$flush_delayed = weak$$choice2
[L865]               0  y$mem_tmp = y
[L866]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L867]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L868]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L869]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L870]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L871]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L872]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L874]               0  y = y$flush_delayed ? y$mem_tmp : y
[L875]               0  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=131069, t1874=131070, t1875=131071, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L877]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
[L18]   CALL         0  reach_error()
[L17]   COND FALSE   0  !(0)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L17]                0  __assert_fail ("0", "safe004_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]

  - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 686 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2247 IncrementalHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 21 mSDtfsCounter, 2247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1044occurred in iteration=10, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 289 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1657 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1359 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-08 16:48:27,634 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ebd770-1fd5-46de-937b-dbec8a352b1a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample