./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme --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 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:46:16,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:46:16,404 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 11:46:16,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:46:16,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:46:16,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:46:16,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:46:16,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:46:16,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:46:16,460 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:46:16,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:46:16,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:46:16,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:46:16,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:46:16,464 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:46:16,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:46:16,465 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:46:16,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:46:16,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:46:16,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:46:16,467 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:46:16,470 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:46:16,471 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:46:16,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:46:16,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:46:16,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:46:16,472 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:46:16,473 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:46:16,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:46:16,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:46:16,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:46:16,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:46:16,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:46:16,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:46:16,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:46:16,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:46:16,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:46:16,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:46:16,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:46:16,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:46:16,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:46:16,479 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_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/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_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme 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 -> 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b [2023-11-26 11:46:16,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:46:16,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:46:16,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:46:16,906 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:46:16,906 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:46:16,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2023-11-26 11:46:20,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:46:20,350 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:46:20,351 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2023-11-26 11:46:20,369 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/data/d0bc72850/af71038f3fed456098639fba706fba40/FLAG1d8e71b98 [2023-11-26 11:46:20,389 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/data/d0bc72850/af71038f3fed456098639fba706fba40 [2023-11-26 11:46:20,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:46:20,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:46:20,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:46:20,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:46:20,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:46:20,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:20,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227e4569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20, skipping insertion in model container [2023-11-26 11:46:20,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:20,460 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:46:20,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:46:20,845 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:46:20,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:46:20,927 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:46:20,928 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:46:20,936 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:46:20,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20 WrapperNode [2023-11-26 11:46:20,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:46:20,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:46:20,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:46:20,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:46:20,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:20,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:20,993 INFO L138 Inliner]: procedures = 174, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2023-11-26 11:46:20,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:46:20,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:46:20,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:46:20,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:46:21,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,064 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-26 11:46:21,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:46:21,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:46:21,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:46:21,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:46:21,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (1/1) ... [2023-11-26 11:46:21,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:46:21,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:46:21,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:46:21,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:46:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:46:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:46:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 11:46:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 11:46:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 11:46:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:46:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:46:21,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:46:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:46:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 11:46:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:46:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:46:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-11-26 11:46:21,192 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-11-26 11:46:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:46:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:46:21,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:46:21,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:46:21,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:46:21,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:46:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 11:46:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:46:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:46:21,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:46:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-11-26 11:46:21,199 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-11-26 11:46:21,201 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:46:21,415 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:46:21,417 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:46:21,795 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:46:21,946 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:46:21,947 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:46:21,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:46:21 BoogieIcfgContainer [2023-11-26 11:46:21,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:46:21,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:46:21,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:46:21,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:46:21,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:46:20" (1/3) ... [2023-11-26 11:46:21,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e92428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:46:21, skipping insertion in model container [2023-11-26 11:46:21,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:46:20" (2/3) ... [2023-11-26 11:46:21,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e92428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:46:21, skipping insertion in model container [2023-11-26 11:46:21,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:46:21" (3/3) ... [2023-11-26 11:46:21,957 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2023-11-26 11:46:21,977 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:46:21,977 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-26 11:46:21,977 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:46:22,048 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-26 11:46:22,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 87 transitions, 202 flow [2023-11-26 11:46:22,143 INFO L124 PetriNetUnfolderBase]: 4/83 cut-off events. [2023-11-26 11:46:22,143 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 11:46:22,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 83 events. 4/83 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 190 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-11-26 11:46:22,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 87 transitions, 202 flow [2023-11-26 11:46:22,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 82 transitions, 188 flow [2023-11-26 11:46:22,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:46:22,172 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4ddbc5f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:46:22,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-26 11:46:22,176 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:46:22,176 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:46:22,177 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:46:22,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:22,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:46:22,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:22,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash 8822, now seen corresponding path program 1 times [2023-11-26 11:46:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:22,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075858713] [2023-11-26 11:46:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:22,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:22,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:22,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075858713] [2023-11-26 11:46:22,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075858713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:22,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:22,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:46:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493266084] [2023-11-26 11:46:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:22,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:22,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-26 11:46:22,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 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) [2023-11-26 11:46:22,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:22,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-26 11:46:22,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:24,143 INFO L124 PetriNetUnfolderBase]: 3169/6129 cut-off events. [2023-11-26 11:46:24,144 INFO L125 PetriNetUnfolderBase]: For 415/416 co-relation queries the response was YES. [2023-11-26 11:46:24,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10847 conditions, 6129 events. 3169/6129 cut-off events. For 415/416 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 49046 event pairs, 3169 based on Foata normal form. 725/6362 useless extension candidates. Maximal degree in co-relation 9422. Up to 4426 conditions per place. [2023-11-26 11:46:24,232 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-26 11:46:24,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 74 transitions, 232 flow [2023-11-26 11:46:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:46:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-26 11:46:24,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-26 11:46:24,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-26 11:46:24,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-26 11:46:24,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:24,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-26 11:46:24,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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) [2023-11-26 11:46:24,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:24,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:24,270 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 188 flow. Second operand 3 states and 186 transitions. [2023-11-26 11:46:24,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 74 transitions, 232 flow [2023-11-26 11:46:24,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 216 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-26 11:46:24,284 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 160 flow [2023-11-26 11:46:24,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2023-11-26 11:46:24,293 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -10 predicate places. [2023-11-26 11:46:24,293 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 160 flow [2023-11-26 11:46:24,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 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) [2023-11-26 11:46:24,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:24,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:46:24,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:46:24,295 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:24,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:24,296 INFO L85 PathProgramCache]: Analyzing trace with hash 8823, now seen corresponding path program 1 times [2023-11-26 11:46:24,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:24,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648482878] [2023-11-26 11:46:24,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:24,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648482878] [2023-11-26 11:46:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648482878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:24,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:24,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:46:24,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060126406] [2023-11-26 11:46:24,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:24,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:24,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:24,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-26 11:46:24,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) [2023-11-26 11:46:24,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:24,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-26 11:46:24,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:25,251 INFO L124 PetriNetUnfolderBase]: 2197/4338 cut-off events. [2023-11-26 11:46:25,252 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-26 11:46:25,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7549 conditions, 4338 events. 2197/4338 cut-off events. For 124/148 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 33055 event pairs, 2197 based on Foata normal form. 325/4344 useless extension candidates. Maximal degree in co-relation 7539. Up to 3129 conditions per place. [2023-11-26 11:46:25,297 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-26 11:46:25,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 212 flow [2023-11-26 11:46:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:46:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-26 11:46:25,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-26 11:46:25,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-26 11:46:25,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-26 11:46:25,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:25,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-26 11:46:25,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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) [2023-11-26 11:46:25,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:25,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:25,319 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 160 flow. Second operand 3 states and 186 transitions. [2023-11-26 11:46:25,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 212 flow [2023-11-26 11:46:25,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:25,326 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 156 flow [2023-11-26 11:46:25,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2023-11-26 11:46:25,334 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -12 predicate places. [2023-11-26 11:46:25,334 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 156 flow [2023-11-26 11:46:25,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) [2023-11-26 11:46:25,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:25,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:46:25,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:46:25,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:25,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash 263100769, now seen corresponding path program 1 times [2023-11-26 11:46:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962203706] [2023-11-26 11:46:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:25,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:25,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962203706] [2023-11-26 11:46:25,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962203706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:25,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:25,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:46:25,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101720526] [2023-11-26 11:46:25,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:25,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:25,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:25,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:25,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:25,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-26 11:46:25,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) [2023-11-26 11:46:25,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:25,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-26 11:46:25,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:26,265 INFO L124 PetriNetUnfolderBase]: 2451/4772 cut-off events. [2023-11-26 11:46:26,266 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-11-26 11:46:26,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8348 conditions, 4772 events. 2451/4772 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 36747 event pairs, 2451 based on Foata normal form. 0/4464 useless extension candidates. Maximal degree in co-relation 8338. Up to 3494 conditions per place. [2023-11-26 11:46:26,311 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-26 11:46:26,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 212 flow [2023-11-26 11:46:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:46:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-26 11:46:26,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2023-11-26 11:46:26,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-26 11:46:26,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-26 11:46:26,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:26,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-26 11:46:26,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 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) [2023-11-26 11:46:26,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:26,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:26,318 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 156 flow. Second operand 3 states and 182 transitions. [2023-11-26 11:46:26,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 212 flow [2023-11-26 11:46:26,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:26,321 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 152 flow [2023-11-26 11:46:26,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-11-26 11:46:26,323 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -14 predicate places. [2023-11-26 11:46:26,323 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 152 flow [2023-11-26 11:46:26,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) [2023-11-26 11:46:26,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:26,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:46:26,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:46:26,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:26,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash 263100770, now seen corresponding path program 1 times [2023-11-26 11:46:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84772320] [2023-11-26 11:46:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:26,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:26,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84772320] [2023-11-26 11:46:26,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84772320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:26,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:26,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:46:26,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015877891] [2023-11-26 11:46:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:26,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:26,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:26,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:26,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:26,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-26 11:46:26,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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) [2023-11-26 11:46:26,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:26,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-26 11:46:26,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:27,186 INFO L124 PetriNetUnfolderBase]: 2197/4302 cut-off events. [2023-11-26 11:46:27,187 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-26 11:46:27,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7513 conditions, 4302 events. 2197/4302 cut-off events. For 124/148 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 32553 event pairs, 2197 based on Foata normal form. 93/4112 useless extension candidates. Maximal degree in co-relation 7503. Up to 3129 conditions per place. [2023-11-26 11:46:27,222 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-26 11:46:27,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 204 flow [2023-11-26 11:46:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:46:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-26 11:46:27,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-26 11:46:27,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-26 11:46:27,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-26 11:46:27,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:27,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-26 11:46:27,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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) [2023-11-26 11:46:27,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:27,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:27,228 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 152 flow. Second operand 3 states and 186 transitions. [2023-11-26 11:46:27,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 204 flow [2023-11-26 11:46:27,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:27,231 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 148 flow [2023-11-26 11:46:27,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-11-26 11:46:27,232 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -16 predicate places. [2023-11-26 11:46:27,233 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 148 flow [2023-11-26 11:46:27,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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) [2023-11-26 11:46:27,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:27,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:27,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:46:27,234 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:27,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash -280017888, now seen corresponding path program 1 times [2023-11-26 11:46:27,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:27,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523319985] [2023-11-26 11:46:27,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:27,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523319985] [2023-11-26 11:46:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523319985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:27,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:27,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:46:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858308206] [2023-11-26 11:46:27,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:27,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:27,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:27,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:27,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-26 11:46:27,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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) [2023-11-26 11:46:27,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:27,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-26 11:46:27,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:27,908 INFO L124 PetriNetUnfolderBase]: 2251/4344 cut-off events. [2023-11-26 11:46:27,908 INFO L125 PetriNetUnfolderBase]: For 118/142 co-relation queries the response was YES. [2023-11-26 11:46:27,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7645 conditions, 4344 events. 2251/4344 cut-off events. For 118/142 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 33130 event pairs, 2251 based on Foata normal form. 0/4106 useless extension candidates. Maximal degree in co-relation 7635. Up to 3219 conditions per place. [2023-11-26 11:46:27,946 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-26 11:46:27,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 204 flow [2023-11-26 11:46:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:46:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-26 11:46:27,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2023-11-26 11:46:27,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-26 11:46:27,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-26 11:46:27,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:27,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-26 11:46:27,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 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) [2023-11-26 11:46:27,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:27,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:27,952 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 148 flow. Second operand 3 states and 182 transitions. [2023-11-26 11:46:27,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 204 flow [2023-11-26 11:46:27,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:27,954 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 144 flow [2023-11-26 11:46:27,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2023-11-26 11:46:27,958 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -18 predicate places. [2023-11-26 11:46:27,958 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 144 flow [2023-11-26 11:46:27,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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) [2023-11-26 11:46:27,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:27,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:27,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:46:27,959 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:27,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:27,961 INFO L85 PathProgramCache]: Analyzing trace with hash -280017887, now seen corresponding path program 1 times [2023-11-26 11:46:27,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:27,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709707675] [2023-11-26 11:46:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:27,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:28,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:28,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709707675] [2023-11-26 11:46:28,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709707675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:28,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:28,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:46:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750468890] [2023-11-26 11:46:28,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:28,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:28,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:28,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:28,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-26 11:46:28,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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) [2023-11-26 11:46:28,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:28,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-26 11:46:28,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:28,655 INFO L124 PetriNetUnfolderBase]: 2197/4260 cut-off events. [2023-11-26 11:46:28,655 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-26 11:46:28,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 4260 events. 2197/4260 cut-off events. For 124/148 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 32189 event pairs, 2197 based on Foata normal form. 36/4055 useless extension candidates. Maximal degree in co-relation 7461. Up to 3129 conditions per place. [2023-11-26 11:46:28,687 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-26 11:46:28,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 196 flow [2023-11-26 11:46:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:46:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-26 11:46:28,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-26 11:46:28,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-26 11:46:28,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-26 11:46:28,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:28,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-26 11:46:28,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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) [2023-11-26 11:46:28,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:28,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:28,693 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 144 flow. Second operand 3 states and 186 transitions. [2023-11-26 11:46:28,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 196 flow [2023-11-26 11:46:28,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 64 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:28,696 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 140 flow [2023-11-26 11:46:28,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2023-11-26 11:46:28,700 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -20 predicate places. [2023-11-26 11:46:28,700 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 140 flow [2023-11-26 11:46:28,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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) [2023-11-26 11:46:28,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:28,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:28,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:46:28,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:28,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1186125515, now seen corresponding path program 1 times [2023-11-26 11:46:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060501558] [2023-11-26 11:46:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:28,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060501558] [2023-11-26 11:46:28,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060501558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:28,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:28,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:46:28,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496827653] [2023-11-26 11:46:28,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:28,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:28,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:28,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:28,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:28,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-26 11:46:28,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) [2023-11-26 11:46:28,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:28,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-26 11:46:28,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:29,428 INFO L124 PetriNetUnfolderBase]: 2319/4340 cut-off events. [2023-11-26 11:46:29,429 INFO L125 PetriNetUnfolderBase]: For 123/147 co-relation queries the response was YES. [2023-11-26 11:46:29,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7733 conditions, 4340 events. 2319/4340 cut-off events. For 123/147 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 32124 event pairs, 2319 based on Foata normal form. 0/4180 useless extension candidates. Maximal degree in co-relation 7723. Up to 3311 conditions per place. [2023-11-26 11:46:29,470 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-26 11:46:29,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 196 flow [2023-11-26 11:46:29,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:46:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-26 11:46:29,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2023-11-26 11:46:29,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-26 11:46:29,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-26 11:46:29,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:29,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-26 11:46:29,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 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) [2023-11-26 11:46:29,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:29,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:29,477 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 140 flow. Second operand 3 states and 182 transitions. [2023-11-26 11:46:29,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 196 flow [2023-11-26 11:46:29,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:29,480 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 136 flow [2023-11-26 11:46:29,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2023-11-26 11:46:29,481 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -22 predicate places. [2023-11-26 11:46:29,481 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 136 flow [2023-11-26 11:46:29,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) [2023-11-26 11:46:29,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:29,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:29,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:46:29,482 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:29,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1186125514, now seen corresponding path program 1 times [2023-11-26 11:46:29,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:29,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499787200] [2023-11-26 11:46:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:29,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:29,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499787200] [2023-11-26 11:46:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499787200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:29,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:29,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:46:29,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517413706] [2023-11-26 11:46:29,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:29,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:29,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:29,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:29,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:29,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-26 11:46:29,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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) [2023-11-26 11:46:29,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:29,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-26 11:46:29,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:30,168 INFO L124 PetriNetUnfolderBase]: 2197/4158 cut-off events. [2023-11-26 11:46:30,169 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-26 11:46:30,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7369 conditions, 4158 events. 2197/4158 cut-off events. For 124/148 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 30835 event pairs, 2197 based on Foata normal form. 60/4079 useless extension candidates. Maximal degree in co-relation 7359. Up to 3129 conditions per place. [2023-11-26 11:46:30,199 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-26 11:46:30,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 188 flow [2023-11-26 11:46:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:46:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-26 11:46:30,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-26 11:46:30,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-26 11:46:30,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-26 11:46:30,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:30,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-26 11:46:30,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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) [2023-11-26 11:46:30,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:30,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:30,208 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 136 flow. Second operand 3 states and 186 transitions. [2023-11-26 11:46:30,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 188 flow [2023-11-26 11:46:30,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:30,210 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 132 flow [2023-11-26 11:46:30,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2023-11-26 11:46:30,214 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -24 predicate places. [2023-11-26 11:46:30,214 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 132 flow [2023-11-26 11:46:30,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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) [2023-11-26 11:46:30,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:30,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:30,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:46:30,215 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:30,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1887044038, now seen corresponding path program 1 times [2023-11-26 11:46:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580935533] [2023-11-26 11:46:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:30,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:30,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:30,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580935533] [2023-11-26 11:46:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580935533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:30,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:30,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:46:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508579648] [2023-11-26 11:46:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:30,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:46:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:46:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:30,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-26 11:46:30,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 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) [2023-11-26 11:46:30,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:30,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-26 11:46:30,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:33,195 INFO L124 PetriNetUnfolderBase]: 17416/28361 cut-off events. [2023-11-26 11:46:33,195 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2023-11-26 11:46:33,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52907 conditions, 28361 events. 17416/28361 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 230036 event pairs, 1911 based on Foata normal form. 0/27787 useless extension candidates. Maximal degree in co-relation 52885. Up to 7302 conditions per place. [2023-11-26 11:46:33,391 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 177 selfloop transitions, 29 changer transitions 0/230 dead transitions. [2023-11-26 11:46:33,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 230 transitions, 920 flow [2023-11-26 11:46:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:46:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 11:46:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 715 transitions. [2023-11-26 11:46:33,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2023-11-26 11:46:33,395 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 715 transitions. [2023-11-26 11:46:33,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 715 transitions. [2023-11-26 11:46:33,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:33,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 715 transitions. [2023-11-26 11:46:33,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 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) [2023-11-26 11:46:33,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 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) [2023-11-26 11:46:33,403 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 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) [2023-11-26 11:46:33,404 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 132 flow. Second operand 11 states and 715 transitions. [2023-11-26 11:46:33,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 230 transitions, 920 flow [2023-11-26 11:46:33,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 230 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:33,412 INFO L231 Difference]: Finished difference. Result has 83 places, 91 transitions, 330 flow [2023-11-26 11:46:33,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=330, PETRI_PLACES=83, PETRI_TRANSITIONS=91} [2023-11-26 11:46:33,414 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -8 predicate places. [2023-11-26 11:46:33,415 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 330 flow [2023-11-26 11:46:33,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 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) [2023-11-26 11:46:33,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:33,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:33,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:46:33,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:33,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash -125491707, now seen corresponding path program 1 times [2023-11-26 11:46:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8973507] [2023-11-26 11:46:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8973507] [2023-11-26 11:46:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8973507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:33,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:46:33,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707660284] [2023-11-26 11:46:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:33,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:46:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:33,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:46:33,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:46:33,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-26 11:46:33,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 91 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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) [2023-11-26 11:46:33,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:33,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-26 11:46:33,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:35,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 88#L721true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,168 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-26 11:46:35,168 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 11:46:35,168 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 11:46:35,168 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 11:46:35,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 88#L721true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,245 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,245 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,245 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,246 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [88#L721true, 6#L749true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,281 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,281 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,282 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,282 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,284 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,285 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,285 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,285 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 33#L740true, 88#L721true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,287 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,287 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,287 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,287 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-26 11:46:35,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 88#L721true, 6#L749true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,355 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,355 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,355 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,355 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,358 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,358 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,358 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,358 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 33#L740true, 88#L721true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,359 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,359 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,359 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,359 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [6#L749true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,384 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,384 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,384 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,384 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [33#L740true, 88#L721true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,385 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,385 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,385 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,386 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 33#L740true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,388 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,388 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,388 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,389 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 88#L721true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,390 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,390 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,391 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,391 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-26 11:46:35,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 6#L749true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,619 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,619 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,619 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,620 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 33#L740true, 88#L721true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,621 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,621 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,621 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,621 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 33#L740true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,625 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,625 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,625 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,625 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 88#L721true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,626 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,627 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,627 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,627 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [33#L740true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,643 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,643 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,643 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,643 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [88#L721true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,644 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,644 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,644 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,645 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,646 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,646 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,646 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,647 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-26 11:46:35,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [88#L721true, 79#L749-2true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,765 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,766 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,766 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,766 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 33#L740true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,767 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,767 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,768 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,768 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 88#L721true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,769 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,769 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,769 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,769 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,772 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,772 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,772 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,772 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, 39#readerEXITtrue, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,793 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,793 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,793 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,793 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-26 11:46:35,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [79#L749-2true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,809 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,809 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,809 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,809 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [33#L740true, 88#L721true, 79#L749-2true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,810 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,810 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,811 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,811 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,812 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,812 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,813 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,813 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-26 11:46:35,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [33#L740true, 79#L749-2true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,837 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-26 11:46:35,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-26 11:46:35,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-26 11:46:35,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-26 11:46:35,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [88#L721true, 79#L749-2true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,839 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-26 11:46:35,839 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-26 11:46:35,839 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-26 11:46:35,839 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-26 11:46:35,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [79#L749-2true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-26 11:46:35,850 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-26 11:46:35,850 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-26 11:46:35,850 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-26 11:46:35,850 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-26 11:46:35,879 INFO L124 PetriNetUnfolderBase]: 11112/19773 cut-off events. [2023-11-26 11:46:35,879 INFO L125 PetriNetUnfolderBase]: For 6387/6809 co-relation queries the response was YES. [2023-11-26 11:46:35,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40735 conditions, 19773 events. 11112/19773 cut-off events. For 6387/6809 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 172252 event pairs, 4354 based on Foata normal form. 1098/20140 useless extension candidates. Maximal degree in co-relation 30925. Up to 8378 conditions per place. [2023-11-26 11:46:36,062 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 45 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2023-11-26 11:46:36,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 477 flow [2023-11-26 11:46:36,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:46:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:46:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2023-11-26 11:46:36,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8007662835249042 [2023-11-26 11:46:36,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 209 transitions. [2023-11-26 11:46:36,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 209 transitions. [2023-11-26 11:46:36,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:36,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 209 transitions. [2023-11-26 11:46:36,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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) [2023-11-26 11:46:36,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:36,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-11-26 11:46:36,067 INFO L175 Difference]: Start difference. First operand has 83 places, 91 transitions, 330 flow. Second operand 3 states and 209 transitions. [2023-11-26 11:46:36,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 477 flow [2023-11-26 11:46:36,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 110 transitions, 477 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:46:36,384 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 346 flow [2023-11-26 11:46:36,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2023-11-26 11:46:36,385 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2023-11-26 11:46:36,386 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 346 flow [2023-11-26 11:46:36,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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) [2023-11-26 11:46:36,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:36,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:36,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:46:36,387 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:36,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash 499745941, now seen corresponding path program 2 times [2023-11-26 11:46:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:36,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181147054] [2023-11-26 11:46:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:36,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:36,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181147054] [2023-11-26 11:46:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181147054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:36,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:46:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138629092] [2023-11-26 11:46:36,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:36,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:46:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:46:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:46:36,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2023-11-26 11:46:36,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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) [2023-11-26 11:46:36,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:36,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2023-11-26 11:46:36,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:37,803 INFO L124 PetriNetUnfolderBase]: 6471/12753 cut-off events. [2023-11-26 11:46:37,803 INFO L125 PetriNetUnfolderBase]: For 6339/6493 co-relation queries the response was YES. [2023-11-26 11:46:37,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27605 conditions, 12753 events. 6471/12753 cut-off events. For 6339/6493 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 113213 event pairs, 1785 based on Foata normal form. 305/12758 useless extension candidates. Maximal degree in co-relation 21660. Up to 4100 conditions per place. [2023-11-26 11:46:37,908 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 63 selfloop transitions, 9 changer transitions 0/135 dead transitions. [2023-11-26 11:46:37,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 135 transitions, 615 flow [2023-11-26 11:46:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:46:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:46:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2023-11-26 11:46:37,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-26 11:46:37,911 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 290 transitions. [2023-11-26 11:46:37,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 290 transitions. [2023-11-26 11:46:37,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:37,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 290 transitions. [2023-11-26 11:46:37,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 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) [2023-11-26 11:46:37,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 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) [2023-11-26 11:46:37,915 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 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) [2023-11-26 11:46:37,915 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 346 flow. Second operand 4 states and 290 transitions. [2023-11-26 11:46:37,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 135 transitions, 615 flow [2023-11-26 11:46:38,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 135 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:38,207 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 412 flow [2023-11-26 11:46:38,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=90, PETRI_TRANSITIONS=99} [2023-11-26 11:46:38,208 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2023-11-26 11:46:38,209 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 412 flow [2023-11-26 11:46:38,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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) [2023-11-26 11:46:38,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:38,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:38,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:46:38,209 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:38,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash 999911387, now seen corresponding path program 1 times [2023-11-26 11:46:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:38,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307948365] [2023-11-26 11:46:38,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:38,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:38,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:38,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307948365] [2023-11-26 11:46:38,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307948365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:38,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:38,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:46:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527236561] [2023-11-26 11:46:38,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:38,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:46:38,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:38,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:46:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:38,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-26 11:46:38,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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) [2023-11-26 11:46:38,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:38,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-26 11:46:38,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:41,044 INFO L124 PetriNetUnfolderBase]: 14821/24540 cut-off events. [2023-11-26 11:46:41,045 INFO L125 PetriNetUnfolderBase]: For 21781/22226 co-relation queries the response was YES. [2023-11-26 11:46:41,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62250 conditions, 24540 events. 14821/24540 cut-off events. For 21781/22226 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 191928 event pairs, 2414 based on Foata normal form. 384/24628 useless extension candidates. Maximal degree in co-relation 52864. Up to 5433 conditions per place. [2023-11-26 11:46:41,252 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 207 selfloop transitions, 63 changer transitions 0/300 dead transitions. [2023-11-26 11:46:41,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 300 transitions, 1822 flow [2023-11-26 11:46:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:46:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 11:46:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 700 transitions. [2023-11-26 11:46:41,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7314524555903866 [2023-11-26 11:46:41,258 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 700 transitions. [2023-11-26 11:46:41,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 700 transitions. [2023-11-26 11:46:41,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:41,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 700 transitions. [2023-11-26 11:46:41,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 63.63636363636363) internal successors, (700), 11 states have internal predecessors, (700), 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) [2023-11-26 11:46:41,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 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) [2023-11-26 11:46:41,277 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 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) [2023-11-26 11:46:41,277 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 412 flow. Second operand 11 states and 700 transitions. [2023-11-26 11:46:41,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 300 transitions, 1822 flow [2023-11-26 11:46:41,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 300 transitions, 1822 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:46:41,917 INFO L231 Difference]: Finished difference. Result has 108 places, 152 transitions, 972 flow [2023-11-26 11:46:41,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=972, PETRI_PLACES=108, PETRI_TRANSITIONS=152} [2023-11-26 11:46:41,918 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 17 predicate places. [2023-11-26 11:46:41,918 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 152 transitions, 972 flow [2023-11-26 11:46:41,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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) [2023-11-26 11:46:41,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:41,919 INFO L208 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] [2023-11-26 11:46:41,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:46:41,919 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:41,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash -801973724, now seen corresponding path program 1 times [2023-11-26 11:46:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:41,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525449009] [2023-11-26 11:46:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:42,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:42,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525449009] [2023-11-26 11:46:42,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525449009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:42,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:42,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:46:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643351422] [2023-11-26 11:46:42,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:42,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:46:42,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:42,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:46:42,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:42,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-26 11:46:42,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 152 transitions, 972 flow. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-26 11:46:42,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:42,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-26 11:46:42,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:45,196 INFO L124 PetriNetUnfolderBase]: 14830/24411 cut-off events. [2023-11-26 11:46:45,196 INFO L125 PetriNetUnfolderBase]: For 37728/37951 co-relation queries the response was YES. [2023-11-26 11:46:45,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72037 conditions, 24411 events. 14830/24411 cut-off events. For 37728/37951 co-relation queries the response was YES. Maximal size of possible extension queue 1230. Compared 188677 event pairs, 2456 based on Foata normal form. 322/24625 useless extension candidates. Maximal degree in co-relation 63196. Up to 6364 conditions per place. [2023-11-26 11:46:45,373 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 186 selfloop transitions, 76 changer transitions 0/292 dead transitions. [2023-11-26 11:46:45,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 292 transitions, 2165 flow [2023-11-26 11:46:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:46:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 11:46:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 629 transitions. [2023-11-26 11:46:45,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7229885057471265 [2023-11-26 11:46:45,376 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 629 transitions. [2023-11-26 11:46:45,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 629 transitions. [2023-11-26 11:46:45,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:45,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 629 transitions. [2023-11-26 11:46:45,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 62.9) internal successors, (629), 10 states have internal predecessors, (629), 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) [2023-11-26 11:46:45,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 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) [2023-11-26 11:46:45,382 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 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) [2023-11-26 11:46:45,382 INFO L175 Difference]: Start difference. First operand has 108 places, 152 transitions, 972 flow. Second operand 10 states and 629 transitions. [2023-11-26 11:46:45,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 292 transitions, 2165 flow [2023-11-26 11:46:46,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 292 transitions, 2163 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-26 11:46:46,370 INFO L231 Difference]: Finished difference. Result has 122 places, 169 transitions, 1369 flow [2023-11-26 11:46:46,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1369, PETRI_PLACES=122, PETRI_TRANSITIONS=169} [2023-11-26 11:46:46,372 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 31 predicate places. [2023-11-26 11:46:46,373 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 169 transitions, 1369 flow [2023-11-26 11:46:46,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-26 11:46:46,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:46,373 INFO L208 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] [2023-11-26 11:46:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:46:46,374 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:46,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash -736272165, now seen corresponding path program 1 times [2023-11-26 11:46:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:46,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864273192] [2023-11-26 11:46:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:46,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:46,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864273192] [2023-11-26 11:46:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864273192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:46:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789737350] [2023-11-26 11:46:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:46,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:46:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:46,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:46:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:46:46,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-26 11:46:46,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 169 transitions, 1369 flow. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-26 11:46:46,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:46,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-26 11:46:46,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:49,704 INFO L124 PetriNetUnfolderBase]: 14937/24284 cut-off events. [2023-11-26 11:46:49,704 INFO L125 PetriNetUnfolderBase]: For 57606/58132 co-relation queries the response was YES. [2023-11-26 11:46:49,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75504 conditions, 24284 events. 14937/24284 cut-off events. For 57606/58132 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 183561 event pairs, 2311 based on Foata normal form. 547/24742 useless extension candidates. Maximal degree in co-relation 68103. Up to 6140 conditions per place. [2023-11-26 11:46:49,890 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 199 selfloop transitions, 86 changer transitions 0/321 dead transitions. [2023-11-26 11:46:49,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 321 transitions, 2679 flow [2023-11-26 11:46:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:46:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 11:46:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 639 transitions. [2023-11-26 11:46:49,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7344827586206897 [2023-11-26 11:46:49,895 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 639 transitions. [2023-11-26 11:46:49,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 639 transitions. [2023-11-26 11:46:49,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:49,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 639 transitions. [2023-11-26 11:46:49,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 63.9) internal successors, (639), 10 states have internal predecessors, (639), 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) [2023-11-26 11:46:49,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 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) [2023-11-26 11:46:49,902 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 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) [2023-11-26 11:46:49,902 INFO L175 Difference]: Start difference. First operand has 122 places, 169 transitions, 1369 flow. Second operand 10 states and 639 transitions. [2023-11-26 11:46:49,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 321 transitions, 2679 flow [2023-11-26 11:46:50,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 321 transitions, 2670 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-26 11:46:50,985 INFO L231 Difference]: Finished difference. Result has 135 places, 187 transitions, 1838 flow [2023-11-26 11:46:50,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1838, PETRI_PLACES=135, PETRI_TRANSITIONS=187} [2023-11-26 11:46:50,987 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 44 predicate places. [2023-11-26 11:46:50,987 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 187 transitions, 1838 flow [2023-11-26 11:46:50,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-26 11:46:50,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:50,988 INFO L208 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, 1, 1] [2023-11-26 11:46:50,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:46:50,988 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:50,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1982938215, now seen corresponding path program 1 times [2023-11-26 11:46:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126089961] [2023-11-26 11:46:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:51,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:51,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126089961] [2023-11-26 11:46:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126089961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:51,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:51,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:46:51,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29893065] [2023-11-26 11:46:51,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:51,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:46:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:51,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:46:51,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:51,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2023-11-26 11:46:51,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 187 transitions, 1838 flow. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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) [2023-11-26 11:46:51,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:51,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2023-11-26 11:46:51,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:53,353 INFO L124 PetriNetUnfolderBase]: 6948/14527 cut-off events. [2023-11-26 11:46:53,353 INFO L125 PetriNetUnfolderBase]: For 39061/39804 co-relation queries the response was YES. [2023-11-26 11:46:53,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44532 conditions, 14527 events. 6948/14527 cut-off events. For 39061/39804 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 136860 event pairs, 2036 based on Foata normal form. 746/15072 useless extension candidates. Maximal degree in co-relation 42775. Up to 3935 conditions per place. [2023-11-26 11:46:53,470 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 61 selfloop transitions, 15 changer transitions 0/197 dead transitions. [2023-11-26 11:46:53,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 197 transitions, 1622 flow [2023-11-26 11:46:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:46:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:46:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2023-11-26 11:46:53,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7954022988505747 [2023-11-26 11:46:53,473 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 346 transitions. [2023-11-26 11:46:53,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 346 transitions. [2023-11-26 11:46:53,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:53,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 346 transitions. [2023-11-26 11:46:53,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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) [2023-11-26 11:46:53,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 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) [2023-11-26 11:46:53,477 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 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) [2023-11-26 11:46:53,478 INFO L175 Difference]: Start difference. First operand has 135 places, 187 transitions, 1838 flow. Second operand 5 states and 346 transitions. [2023-11-26 11:46:53,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 197 transitions, 1622 flow [2023-11-26 11:46:54,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 197 transitions, 1511 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-11-26 11:46:54,177 INFO L231 Difference]: Finished difference. Result has 133 places, 163 transitions, 1327 flow [2023-11-26 11:46:54,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1327, PETRI_PLACES=133, PETRI_TRANSITIONS=163} [2023-11-26 11:46:54,178 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 42 predicate places. [2023-11-26 11:46:54,178 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 163 transitions, 1327 flow [2023-11-26 11:46:54,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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) [2023-11-26 11:46:54,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:54,179 INFO L208 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, 1, 1] [2023-11-26 11:46:54,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:46:54,179 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:54,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1844445949, now seen corresponding path program 2 times [2023-11-26 11:46:54,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:54,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997100157] [2023-11-26 11:46:54,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:54,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997100157] [2023-11-26 11:46:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997100157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:54,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:46:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089667874] [2023-11-26 11:46:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:54,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:46:54,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:46:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:46:54,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2023-11-26 11:46:54,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 163 transitions, 1327 flow. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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) [2023-11-26 11:46:54,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:54,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2023-11-26 11:46:54,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:55,678 INFO L124 PetriNetUnfolderBase]: 4963/10484 cut-off events. [2023-11-26 11:46:55,678 INFO L125 PetriNetUnfolderBase]: For 23929/24612 co-relation queries the response was YES. [2023-11-26 11:46:55,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33221 conditions, 10484 events. 4963/10484 cut-off events. For 23929/24612 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 92075 event pairs, 1191 based on Foata normal form. 527/10922 useless extension candidates. Maximal degree in co-relation 32501. Up to 2755 conditions per place. [2023-11-26 11:46:55,778 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 63 selfloop transitions, 17 changer transitions 0/161 dead transitions. [2023-11-26 11:46:55,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 161 transitions, 1152 flow [2023-11-26 11:46:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:46:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:46:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 348 transitions. [2023-11-26 11:46:55,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8 [2023-11-26 11:46:55,780 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 348 transitions. [2023-11-26 11:46:55,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 348 transitions. [2023-11-26 11:46:55,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:55,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 348 transitions. [2023-11-26 11:46:55,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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) [2023-11-26 11:46:55,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 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) [2023-11-26 11:46:55,784 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 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) [2023-11-26 11:46:55,784 INFO L175 Difference]: Start difference. First operand has 133 places, 163 transitions, 1327 flow. Second operand 5 states and 348 transitions. [2023-11-26 11:46:55,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 161 transitions, 1152 flow [2023-11-26 11:46:55,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 161 transitions, 1008 flow, removed 12 selfloop flow, removed 19 redundant places. [2023-11-26 11:46:55,981 INFO L231 Difference]: Finished difference. Result has 112 places, 121 transitions, 787 flow [2023-11-26 11:46:55,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=787, PETRI_PLACES=112, PETRI_TRANSITIONS=121} [2023-11-26 11:46:55,983 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 21 predicate places. [2023-11-26 11:46:55,983 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 121 transitions, 787 flow [2023-11-26 11:46:55,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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) [2023-11-26 11:46:55,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:46:55,983 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:55,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:46:55,984 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-26 11:46:55,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:46:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1633202971, now seen corresponding path program 1 times [2023-11-26 11:46:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:46:55,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043355783] [2023-11-26 11:46:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:46:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:46:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:46:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:46:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:46:57,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043355783] [2023-11-26 11:46:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043355783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:46:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:46:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:46:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092914591] [2023-11-26 11:46:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:46:57,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:46:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:46:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:46:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:46:57,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 87 [2023-11-26 11:46:57,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 121 transitions, 787 flow. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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) [2023-11-26 11:46:57,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:46:57,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 87 [2023-11-26 11:46:57,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:46:58,508 INFO L124 PetriNetUnfolderBase]: 4975/10169 cut-off events. [2023-11-26 11:46:58,509 INFO L125 PetriNetUnfolderBase]: For 22856/23464 co-relation queries the response was YES. [2023-11-26 11:46:58,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30487 conditions, 10169 events. 4975/10169 cut-off events. For 22856/23464 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 86794 event pairs, 4259 based on Foata normal form. 93/9998 useless extension candidates. Maximal degree in co-relation 7545. Up to 7272 conditions per place. [2023-11-26 11:46:58,543 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 0 selfloop transitions, 0 changer transitions 120/120 dead transitions. [2023-11-26 11:46:58,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 120 transitions, 865 flow [2023-11-26 11:46:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:46:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:46:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2023-11-26 11:46:58,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867816091954023 [2023-11-26 11:46:58,545 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 239 transitions. [2023-11-26 11:46:58,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 239 transitions. [2023-11-26 11:46:58,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:46:58,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 239 transitions. [2023-11-26 11:46:58,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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) [2023-11-26 11:46:58,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 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) [2023-11-26 11:46:58,548 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 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) [2023-11-26 11:46:58,549 INFO L175 Difference]: Start difference. First operand has 112 places, 121 transitions, 787 flow. Second operand 4 states and 239 transitions. [2023-11-26 11:46:58,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 120 transitions, 865 flow [2023-11-26 11:46:58,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 120 transitions, 843 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-26 11:46:58,606 INFO L231 Difference]: Finished difference. Result has 112 places, 0 transitions, 0 flow [2023-11-26 11:46:58,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=112, PETRI_TRANSITIONS=0} [2023-11-26 11:46:58,606 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 21 predicate places. [2023-11-26 11:46:58,606 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 0 transitions, 0 flow [2023-11-26 11:46:58,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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) [2023-11-26 11:46:58,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-11-26 11:46:58,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2023-11-26 11:46:58,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-11-26 11:46:58,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-11-26 11:46:58,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-11-26 11:46:58,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-11-26 11:46:58,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-11-26 11:46:58,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-11-26 11:46:58,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-11-26 11:46:58,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-11-26 11:46:58,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-11-26 11:46:58,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-11-26 11:46:58,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-11-26 11:46:58,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-11-26 11:46:58,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-11-26 11:46:58,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-11-26 11:46:58,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-11-26 11:46:58,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (6 of 24 remaining) [2023-11-26 11:46:58,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 24 remaining) [2023-11-26 11:46:58,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-11-26 11:46:58,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-11-26 11:46:58,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-11-26 11:46:58,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 24 remaining) [2023-11-26 11:46:58,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-11-26 11:46:58,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:46:58,619 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:46:58,626 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:46:58,627 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:46:58,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:46:58 BasicIcfg [2023-11-26 11:46:58,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:46:58,633 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:46:58,633 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:46:58,633 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:46:58,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:46:21" (3/4) ... [2023-11-26 11:46:58,636 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 11:46:58,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reader [2023-11-26 11:46:58,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure writer [2023-11-26 11:46:58,645 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2023-11-26 11:46:58,645 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-26 11:46:58,646 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-26 11:46:58,646 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 11:46:58,736 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:46:58,737 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 11:46:58,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:46:58,738 INFO L158 Benchmark]: Toolchain (without parser) took 38344.23ms. Allocated memory was 130.0MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 82.5MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-26 11:46:58,738 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:46:58,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.28ms. Allocated memory is still 130.0MB. Free memory was 82.5MB in the beginning and 62.0MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.58ms. Allocated memory is still 130.0MB. Free memory was 61.8MB in the beginning and 59.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,739 INFO L158 Benchmark]: Boogie Preprocessor took 105.39ms. Allocated memory is still 130.0MB. Free memory was 59.7MB in the beginning and 57.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,740 INFO L158 Benchmark]: RCFGBuilder took 843.36ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 57.1MB in the beginning and 141.2MB in the end (delta: -84.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,740 INFO L158 Benchmark]: TraceAbstraction took 36681.88ms. Allocated memory was 182.5MB in the beginning and 10.9GB in the end (delta: 10.7GB). Free memory was 140.1MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-26 11:46:58,741 INFO L158 Benchmark]: Witness Printer took 103.89ms. Allocated memory is still 10.9GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:46:58,743 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.32ms. Allocated memory is still 130.0MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.28ms. Allocated memory is still 130.0MB. Free memory was 82.5MB in the beginning and 62.0MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.58ms. Allocated memory is still 130.0MB. Free memory was 61.8MB in the beginning and 59.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.39ms. Allocated memory is still 130.0MB. Free memory was 59.7MB in the beginning and 57.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 843.36ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 57.1MB in the beginning and 141.2MB in the end (delta: -84.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 36681.88ms. Allocated memory was 182.5MB in the beginning and 10.9GB in the end (delta: 10.7GB). Free memory was 140.1MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 103.89ms. Allocated memory is still 10.9GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 743]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 24 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: 36.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 33.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1484 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1116 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2787 IncrementalHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 134 mSDtfsCounter, 2787 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=14, InterpolantAutomatonStates: 87, 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, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 2731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-26 11:46:58,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad16c20-1e91-4e49-a35b-87c5202e532f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE