./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI --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 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:04:37,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:04:37,347 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 22:04:37,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:04:37,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:04:37,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:04:37,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:04:37,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:04:37,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:04:37,385 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:04:37,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:04:37,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:04:37,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:04:37,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:04:37,389 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:04:37,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:04:37,390 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:04:37,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:04:37,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:04:37,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:04:37,392 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:04:37,393 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:04:37,393 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:04:37,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:04:37,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:04:37,395 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:04:37,396 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:04:37,397 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:04:37,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:04:37,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:04:37,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:04:37,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:04:37,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:04:37,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:04:37,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:04:37,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 22:04:37,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:04:37,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:04:37,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:04:37,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:04:37,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:04:37,409 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_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/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_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI 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 -> 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a [2023-11-24 22:04:37,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:04:37,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:04:37,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:04:37,721 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:04:37,722 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:04:37,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 22:04:40,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:04:41,300 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:04:41,305 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 22:04:41,331 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/data/909a77ac3/0a0dd2aee5404b7a9dab83e105a96d95/FLAG868841ee9 [2023-11-24 22:04:41,351 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/data/909a77ac3/0a0dd2aee5404b7a9dab83e105a96d95 [2023-11-24 22:04:41,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:04:41,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:04:41,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:04:41,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:04:41,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:04:41,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:04:41" (1/1) ... [2023-11-24 22:04:41,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3627db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:41, skipping insertion in model container [2023-11-24 22:04:41,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:04:41" (1/1) ... [2023-11-24 22:04:41,447 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:04:41,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:04:41,919 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:04:41,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:04:42,019 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:04:42,020 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:04:42,028 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:04:42,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42 WrapperNode [2023-11-24 22:04:42,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:04:42,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:04:42,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:04:42,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:04:42,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,146 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-24 22:04:42,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:04:42,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:04:42,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:04:42,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:04:42,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,188 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 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-24 22:04:42,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:04:42,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:04:42,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:04:42,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:04:42,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (1/1) ... [2023-11-24 22:04:42,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:04:42,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:04:42,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:04:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 22:04:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 22:04:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 22:04:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 22:04:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 22:04:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:04:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:04:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:04:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:04:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:04:42,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:04:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:04:42,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:04:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 22:04:42,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 22:04:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-24 22:04:42,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-24 22:04:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 22:04:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 22:04:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 22:04:42,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6212e99-c1a3-407d-b5c0-99d3e8fa20d5/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:04:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 22:04:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 22:04:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:04:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:04:42,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:04:42,310 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:04:42,492 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:04:42,494 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:04:42,990 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:04:43,276 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:04:43,279 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:04:43,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:04:43 BoogieIcfgContainer [2023-11-24 22:04:43,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:04:43,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:04:43,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:04:43,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:04:43,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:04:41" (1/3) ... [2023-11-24 22:04:43,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2996f0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:04:43, skipping insertion in model container [2023-11-24 22:04:43,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:42" (2/3) ... [2023-11-24 22:04:43,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2996f0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:04:43, skipping insertion in model container [2023-11-24 22:04:43,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:04:43" (3/3) ... [2023-11-24 22:04:43,299 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 22:04:43,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:04:43,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-24 22:04:43,330 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:04:43,413 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:04:43,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-24 22:04:43,531 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-24 22:04:43,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:04:43,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 124 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-24 22:04:43,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-24 22:04:43,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-24 22:04:43,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:04:43,565 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;@6b7569b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:04:43,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-24 22:04:43,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:04:43,569 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:04:43,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:04:43,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:43,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:04:43,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:43,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 14179, now seen corresponding path program 1 times [2023-11-24 22:04:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:43,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217201544] [2023-11-24 22:04:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:43,865 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-24 22:04:43,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:43,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217201544] [2023-11-24 22:04:43,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217201544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:43,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:43,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:04:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585533055] [2023-11-24 22:04:43,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:43,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:43,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:43,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:43,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:43,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-24 22:04:43,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-24 22:04:43,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:43,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-24 22:04:43,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:45,749 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-24 22:04:45,749 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-24 22:04:45,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53752 event pairs, 3179 based on Foata normal form. 360/6957 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-24 22:04:45,837 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-24 22:04:45,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-24 22:04:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 22:04:45,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 22:04:45,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 22:04:45,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 22:04:45,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:45,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 22:04:45,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-24 22:04:45,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:45,868 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:45,870 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-24 22:04:45,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-24 22:04:45,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 22:04:45,889 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-24 22:04:45,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-24 22:04:45,896 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-24 22:04:45,896 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-24 22:04:45,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-24 22:04:45,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:45,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:04:45,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 22:04:45,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:45,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash 14180, now seen corresponding path program 1 times [2023-11-24 22:04:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:45,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520562433] [2023-11-24 22:04:45,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:46,082 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-24 22:04:46,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520562433] [2023-11-24 22:04:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520562433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:46,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:46,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:04:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238843862] [2023-11-24 22:04:46,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:46,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:46,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:46,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:46,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:46,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 22:04:46,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-24 22:04:46,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:46,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 22:04:46,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:47,606 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-24 22:04:47,606 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-24 22:04:47,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53760 event pairs, 3179 based on Foata normal form. 1/6597 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-24 22:04:47,680 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-24 22:04:47,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-24 22:04:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 22:04:47,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 22:04:47,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 22:04:47,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 22:04:47,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:47,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 22:04:47,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-24 22:04:47,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:47,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:47,700 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-24 22:04:47,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-24 22:04:47,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:47,717 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-24 22:04:47,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-24 22:04:47,725 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-24 22:04:47,725 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-24 22:04:47,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-24 22:04:47,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:47,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:04:47,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 22:04:47,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:47,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash 422848411, now seen corresponding path program 1 times [2023-11-24 22:04:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507427454] [2023-11-24 22:04:47,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:47,982 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-24 22:04:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:47,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507427454] [2023-11-24 22:04:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507427454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:47,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:47,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:04:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394739466] [2023-11-24 22:04:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:47,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:47,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:47,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:47,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 22:04:47,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-24 22:04:47,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:47,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 22:04:47,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:49,236 INFO L124 PetriNetUnfolderBase]: 3311/5478 cut-off events. [2023-11-24 22:04:49,236 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-24 22:04:49,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 5478 events. 3311/5478 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39077 event pairs, 593 based on Foata normal form. 0/5400 useless extension candidates. Maximal degree in co-relation 10289. Up to 3661 conditions per place. [2023-11-24 22:04:49,283 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-24 22:04:49,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 262 flow [2023-11-24 22:04:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-24 22:04:49,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-24 22:04:49,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-24 22:04:49,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-24 22:04:49,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:49,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-24 22:04:49,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-24 22:04:49,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:49,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:49,291 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 157 transitions. [2023-11-24 22:04:49,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 262 flow [2023-11-24 22:04:49,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:49,297 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-24 22:04:49,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-24 22:04:49,299 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-24 22:04:49,299 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-24 22:04:49,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-24 22:04:49,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:49,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:04:49,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 22:04:49,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:49,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:49,302 INFO L85 PathProgramCache]: Analyzing trace with hash 422847131, now seen corresponding path program 1 times [2023-11-24 22:04:49,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:49,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019664869] [2023-11-24 22:04:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:49,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:49,363 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-24 22:04:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:49,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019664869] [2023-11-24 22:04:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019664869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:49,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:49,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521823711] [2023-11-24 22:04:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:49,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:49,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:49,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-24 22:04:49,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-24 22:04:49,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:49,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-24 22:04:49,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:50,292 INFO L124 PetriNetUnfolderBase]: 2906/5175 cut-off events. [2023-11-24 22:04:50,292 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-24 22:04:50,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9587 conditions, 5175 events. 2906/5175 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 37793 event pairs, 1880 based on Foata normal form. 0/4923 useless extension candidates. Maximal degree in co-relation 9576. Up to 3466 conditions per place. [2023-11-24 22:04:50,328 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-24 22:04:50,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-24 22:04:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-24 22:04:50,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-24 22:04:50,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-24 22:04:50,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-24 22:04:50,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:50,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-24 22:04:50,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-24 22:04:50,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:50,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:50,332 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 141 transitions. [2023-11-24 22:04:50,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-24 22:04:50,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:50,335 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-24 22:04:50,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-24 22:04:50,336 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-24 22:04:50,336 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-24 22:04:50,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-24 22:04:50,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:50,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:04:50,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 22:04:50,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:50,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash 422847132, now seen corresponding path program 1 times [2023-11-24 22:04:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:50,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017476359] [2023-11-24 22:04:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:50,395 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-24 22:04:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017476359] [2023-11-24 22:04:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017476359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:50,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:50,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353774380] [2023-11-24 22:04:50,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:50,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:50,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:50,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 22:04:50,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-24 22:04:50,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:50,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 22:04:50,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:51,272 INFO L124 PetriNetUnfolderBase]: 2903/5168 cut-off events. [2023-11-24 22:04:51,273 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-24 22:04:51,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9441 conditions, 5168 events. 2903/5168 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 37655 event pairs, 1880 based on Foata normal form. 4/4920 useless extension candidates. Maximal degree in co-relation 9431. Up to 3459 conditions per place. [2023-11-24 22:04:51,310 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-24 22:04:51,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 206 flow [2023-11-24 22:04:51,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-24 22:04:51,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 22:04:51,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-24 22:04:51,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-24 22:04:51,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:51,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-24 22:04:51,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-24 22:04:51,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:51,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:51,315 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 143 transitions. [2023-11-24 22:04:51,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 206 flow [2023-11-24 22:04:51,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:51,318 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-24 22:04:51,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-24 22:04:51,319 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-24 22:04:51,320 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-24 22:04:51,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-24 22:04:51,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:51,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:51,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 22:04:51,321 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:51,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash -99761962, now seen corresponding path program 1 times [2023-11-24 22:04:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:51,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961975483] [2023-11-24 22:04:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:51,367 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-24 22:04:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961975483] [2023-11-24 22:04:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961975483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:51,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:51,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091114177] [2023-11-24 22:04:51,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:51,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:51,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:51,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:51,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-24 22:04:51,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-24 22:04:51,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:51,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-24 22:04:51,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:52,348 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-24 22:04:52,349 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-24 22:04:52,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 5121 events. 2920/5121 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 36967 event pairs, 1892 based on Foata normal form. 0/4891 useless extension candidates. Maximal degree in co-relation 9413. Up to 3460 conditions per place. [2023-11-24 22:04:52,395 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-24 22:04:52,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-24 22:04:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-24 22:04:52,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-24 22:04:52,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-24 22:04:52,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-24 22:04:52,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:52,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-24 22:04:52,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-24 22:04:52,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:52,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:52,401 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-24 22:04:52,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-24 22:04:52,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:52,405 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-24 22:04:52,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-24 22:04:52,409 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-24 22:04:52,409 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-24 22:04:52,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-24 22:04:52,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:52,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:52,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 22:04:52,411 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:52,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash -99761961, now seen corresponding path program 1 times [2023-11-24 22:04:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:52,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735649100] [2023-11-24 22:04:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:52,537 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-24 22:04:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:52,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735649100] [2023-11-24 22:04:52,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735649100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:52,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:52,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407577891] [2023-11-24 22:04:52,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:52,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:52,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:52,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 22:04:52,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-24 22:04:52,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:52,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 22:04:52,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:53,598 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-24 22:04:53,598 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-24 22:04:53,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 36674 event pairs, 1884 based on Foata normal form. 12/4886 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-24 22:04:53,643 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-24 22:04:53,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-24 22:04:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-24 22:04:53,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 22:04:53,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-24 22:04:53,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-24 22:04:53,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:53,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-24 22:04:53,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-24 22:04:53,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:53,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:53,651 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-24 22:04:53,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-24 22:04:53,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:53,655 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-24 22:04:53,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-24 22:04:53,656 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-24 22:04:53,657 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-24 22:04:53,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-24 22:04:53,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:53,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:53,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 22:04:53,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:53,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:53,659 INFO L85 PathProgramCache]: Analyzing trace with hash 109193433, now seen corresponding path program 1 times [2023-11-24 22:04:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:53,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390024434] [2023-11-24 22:04:53,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:53,743 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-24 22:04:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:53,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390024434] [2023-11-24 22:04:53,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390024434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:53,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:53,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:53,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083802153] [2023-11-24 22:04:53,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:53,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:53,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:53,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:53,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:53,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-24 22:04:53,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-24 22:04:53,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:53,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-24 22:04:53,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:54,702 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-24 22:04:54,702 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-24 22:04:54,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36271 event pairs, 1424 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-24 22:04:54,736 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-24 22:04:54,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-24 22:04:54,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-24 22:04:54,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-24 22:04:54,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-24 22:04:54,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-24 22:04:54,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:54,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-24 22:04:54,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-24 22:04:54,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:54,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:54,741 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-24 22:04:54,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-24 22:04:54,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:54,747 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-24 22:04:54,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-24 22:04:54,750 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-24 22:04:54,751 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-24 22:04:54,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-24 22:04:54,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:54,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:54,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 22:04:54,752 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:54,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash 109193434, now seen corresponding path program 1 times [2023-11-24 22:04:54,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:54,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324414428] [2023-11-24 22:04:54,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:54,884 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-24 22:04:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324414428] [2023-11-24 22:04:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324414428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:54,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255247139] [2023-11-24 22:04:54,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:54,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:54,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:54,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:54,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:54,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 22:04:54,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-24 22:04:54,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:54,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 22:04:54,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:55,557 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-24 22:04:55,558 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-24 22:04:55,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36428 event pairs, 920 based on Foata normal form. 36/4974 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-24 22:04:55,596 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-24 22:04:55,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-24 22:04:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-24 22:04:55,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 22:04:55,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-24 22:04:55,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-24 22:04:55,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:55,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-24 22:04:55,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-24 22:04:55,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:55,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 22:04:55,601 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-24 22:04:55,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-24 22:04:55,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:55,604 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-24 22:04:55,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-24 22:04:55,605 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-24 22:04:55,605 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-24 22:04:55,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-24 22:04:55,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:55,606 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-24 22:04:55,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 22:04:55,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:55,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -591535221, now seen corresponding path program 1 times [2023-11-24 22:04:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010348396] [2023-11-24 22:04:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:56,577 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-24 22:04:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010348396] [2023-11-24 22:04:56,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010348396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:56,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:56,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 22:04:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748393539] [2023-11-24 22:04:56,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:56,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 22:04:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 22:04:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-24 22:04:57,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 22:04:57,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 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-24 22:04:57,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:57,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 22:04:57,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:58,315 INFO L124 PetriNetUnfolderBase]: 3664/5602 cut-off events. [2023-11-24 22:04:58,315 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-24 22:04:58,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10972 conditions, 5602 events. 3664/5602 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 35243 event pairs, 152 based on Foata normal form. 180/5740 useless extension candidates. Maximal degree in co-relation 10962. Up to 3384 conditions per place. [2023-11-24 22:04:58,349 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 48 selfloop transitions, 5 changer transitions 13/87 dead transitions. [2023-11-24 22:04:58,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 320 flow [2023-11-24 22:04:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 22:04:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 22:04:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 331 transitions. [2023-11-24 22:04:58,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6268939393939394 [2023-11-24 22:04:58,352 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 331 transitions. [2023-11-24 22:04:58,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 331 transitions. [2023-11-24 22:04:58,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:58,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 331 transitions. [2023-11-24 22:04:58,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 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-24 22:04:58,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 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-24 22:04:58,357 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 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-24 22:04:58,357 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 8 states and 331 transitions. [2023-11-24 22:04:58,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 320 flow [2023-11-24 22:04:58,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:58,359 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 112 flow [2023-11-24 22:04:58,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2023-11-24 22:04:58,362 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-24 22:04:58,362 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 112 flow [2023-11-24 22:04:58,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 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-24 22:04:58,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:58,362 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-24 22:04:58,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 22:04:58,363 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:04:58,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash -591533723, now seen corresponding path program 1 times [2023-11-24 22:04:58,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:58,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366280675] [2023-11-24 22:04:58,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:58,618 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-24 22:04:58,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:58,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366280675] [2023-11-24 22:04:58,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366280675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:58,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:58,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:04:58,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279248067] [2023-11-24 22:04:58,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:58,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:04:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:58,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:04:58,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:04:58,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2023-11-24 22:04:58,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 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-24 22:04:58,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:58,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2023-11-24 22:04:58,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:05:03,082 INFO L124 PetriNetUnfolderBase]: 26337/38202 cut-off events. [2023-11-24 22:05:03,082 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2023-11-24 22:05:03,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75995 conditions, 38202 events. 26337/38202 cut-off events. For 1886/1886 co-relation queries the response was YES. Maximal size of possible extension queue 1697. Compared 274173 event pairs, 7090 based on Foata normal form. 0/37323 useless extension candidates. Maximal degree in co-relation 75984. Up to 16162 conditions per place. [2023-11-24 22:05:03,260 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 46 selfloop transitions, 7 changer transitions 95/165 dead transitions. [2023-11-24 22:05:03,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 165 transitions, 666 flow [2023-11-24 22:05:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 22:05:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 22:05:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 420 transitions. [2023-11-24 22:05:03,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2023-11-24 22:05:03,263 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 420 transitions. [2023-11-24 22:05:03,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 420 transitions. [2023-11-24 22:05:03,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:05:03,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 420 transitions. [2023-11-24 22:05:03,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 46.666666666666664) internal successors, (420), 9 states have internal predecessors, (420), 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-24 22:05:03,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 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-24 22:05:03,268 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 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-24 22:05:03,268 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 112 flow. Second operand 9 states and 420 transitions. [2023-11-24 22:05:03,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 165 transitions, 666 flow [2023-11-24 22:05:03,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 165 transitions, 646 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-24 22:05:03,273 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 200 flow [2023-11-24 22:05:03,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=200, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-11-24 22:05:03,274 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-24 22:05:03,274 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 200 flow [2023-11-24 22:05:03,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 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-24 22:05:03,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:05:03,275 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] [2023-11-24 22:05:03,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 22:05:03,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:05:03,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:05:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1525181884, now seen corresponding path program 1 times [2023-11-24 22:05:03,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:05:03,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973006257] [2023-11-24 22:05:03,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:05:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:05:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:05:03,507 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-24 22:05:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:05:03,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973006257] [2023-11-24 22:05:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973006257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:05:03,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:05:03,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:05:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461367135] [2023-11-24 22:05:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:05:03,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:05:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:05:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:05:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:05:03,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-24 22:05:03,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 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-24 22:05:03,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:05:03,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-24 22:05:03,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:05:07,281 INFO L124 PetriNetUnfolderBase]: 14905/23937 cut-off events. [2023-11-24 22:05:07,282 INFO L125 PetriNetUnfolderBase]: For 21553/23255 co-relation queries the response was YES. [2023-11-24 22:05:07,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63830 conditions, 23937 events. 14905/23937 cut-off events. For 21553/23255 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 190368 event pairs, 4201 based on Foata normal form. 844/24225 useless extension candidates. Maximal degree in co-relation 63811. Up to 13036 conditions per place. [2023-11-24 22:05:07,453 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 34 selfloop transitions, 3 changer transitions 43/105 dead transitions. [2023-11-24 22:05:07,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 105 transitions, 528 flow [2023-11-24 22:05:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 22:05:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 22:05:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 314 transitions. [2023-11-24 22:05:07,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2023-11-24 22:05:07,458 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 314 transitions. [2023-11-24 22:05:07,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 314 transitions. [2023-11-24 22:05:07,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:05:07,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 314 transitions. [2023-11-24 22:05:07,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.857142857142854) internal successors, (314), 7 states have internal predecessors, (314), 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-24 22:05:07,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 22:05:07,467 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 22:05:07,467 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 200 flow. Second operand 7 states and 314 transitions. [2023-11-24 22:05:07,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 105 transitions, 528 flow [2023-11-24 22:05:07,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 478 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-24 22:05:07,656 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 189 flow [2023-11-24 22:05:07,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-11-24 22:05:07,657 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-24 22:05:07,657 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 189 flow [2023-11-24 22:05:07,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 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-24 22:05:07,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:05:07,658 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] [2023-11-24 22:05:07,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 22:05:07,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:05:07,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:05:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1224000230, now seen corresponding path program 1 times [2023-11-24 22:05:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:05:07,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012125842] [2023-11-24 22:05:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:05:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:05:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:05:07,916 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-24 22:05:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:05:07,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012125842] [2023-11-24 22:05:07,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012125842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:05:07,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:05:07,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:05:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446951350] [2023-11-24 22:05:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:05:07,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:05:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:05:07,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:05:07,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:05:07,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2023-11-24 22:05:07,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 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-24 22:05:07,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:05:07,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2023-11-24 22:05:07,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:05:11,777 INFO L124 PetriNetUnfolderBase]: 18071/26692 cut-off events. [2023-11-24 22:05:11,777 INFO L125 PetriNetUnfolderBase]: For 27558/27617 co-relation queries the response was YES. [2023-11-24 22:05:11,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74142 conditions, 26692 events. 18071/26692 cut-off events. For 27558/27617 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 185153 event pairs, 5479 based on Foata normal form. 649/27319 useless extension candidates. Maximal degree in co-relation 74120. Up to 13648 conditions per place. [2023-11-24 22:05:11,912 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 63 selfloop transitions, 11 changer transitions 74/165 dead transitions. [2023-11-24 22:05:11,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 165 transitions, 903 flow [2023-11-24 22:05:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 22:05:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 22:05:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 447 transitions. [2023-11-24 22:05:11,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2023-11-24 22:05:11,917 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 447 transitions. [2023-11-24 22:05:11,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 447 transitions. [2023-11-24 22:05:11,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:05:11,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 447 transitions. [2023-11-24 22:05:11,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 44.7) internal successors, (447), 10 states have internal predecessors, (447), 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-24 22:05:11,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 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-24 22:05:11,922 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 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-24 22:05:11,922 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 189 flow. Second operand 10 states and 447 transitions. [2023-11-24 22:05:11,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 165 transitions, 903 flow [2023-11-24 22:05:12,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 165 transitions, 861 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-11-24 22:05:12,699 INFO L231 Difference]: Finished difference. Result has 78 places, 57 transitions, 260 flow [2023-11-24 22:05:12,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=260, PETRI_PLACES=78, PETRI_TRANSITIONS=57} [2023-11-24 22:05:12,701 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2023-11-24 22:05:12,701 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 260 flow [2023-11-24 22:05:12,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 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-24 22:05:12,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:05:12,701 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] [2023-11-24 22:05:12,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 22:05:12,702 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:05:12,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:05:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1930751845, now seen corresponding path program 1 times [2023-11-24 22:05:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:05:12,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314049968] [2023-11-24 22:05:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:05:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:05:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:05:13,003 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-24 22:05:13,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:05:13,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314049968] [2023-11-24 22:05:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314049968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:05:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:05:13,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:05:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120532769] [2023-11-24 22:05:13,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:05:13,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:05:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:05:13,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:05:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:05:13,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-24 22:05:13,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 57 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-24 22:05:13,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:05:13,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-24 22:05:13,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:05:18,522 INFO L124 PetriNetUnfolderBase]: 28937/43311 cut-off events. [2023-11-24 22:05:18,523 INFO L125 PetriNetUnfolderBase]: For 35707/38386 co-relation queries the response was YES. [2023-11-24 22:05:18,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107042 conditions, 43311 events. 28937/43311 cut-off events. For 35707/38386 co-relation queries the response was YES. Maximal size of possible extension queue 1633. Compared 316683 event pairs, 5152 based on Foata normal form. 1573/43647 useless extension candidates. Maximal degree in co-relation 107018. Up to 23158 conditions per place. [2023-11-24 22:05:18,764 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 57 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2023-11-24 22:05:18,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 482 flow [2023-11-24 22:05:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:05:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:05:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2023-11-24 22:05:18,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2023-11-24 22:05:18,766 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 190 transitions. [2023-11-24 22:05:18,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 190 transitions. [2023-11-24 22:05:18,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:05:18,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 190 transitions. [2023-11-24 22:05:18,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 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-24 22:05:18,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 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-24 22:05:18,768 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 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-24 22:05:18,768 INFO L175 Difference]: Start difference. First operand has 78 places, 57 transitions, 260 flow. Second operand 4 states and 190 transitions. [2023-11-24 22:05:18,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 482 flow [2023-11-24 22:05:19,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 91 transitions, 466 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-24 22:05:19,285 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 290 flow [2023-11-24 22:05:19,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2023-11-24 22:05:19,286 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-24 22:05:19,286 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 290 flow [2023-11-24 22:05:19,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-24 22:05:19,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:05:19,287 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] [2023-11-24 22:05:19,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 22:05:19,287 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:05:19,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:05:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2121195111, now seen corresponding path program 1 times [2023-11-24 22:05:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:05:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810045112] [2023-11-24 22:05:19,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:05:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:05:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:05:19,529 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-24 22:05:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:05:19,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810045112] [2023-11-24 22:05:19,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810045112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:05:19,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:05:19,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:05:19,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194359321] [2023-11-24 22:05:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:05:19,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:05:19,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:05:19,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:05:19,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:05:19,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 22:05:19,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 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-24 22:05:19,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:05:19,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 22:05:19,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:05:21,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [Black: 153#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, 38#L793true, 27#L806true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, 45#P0EXITtrue, Black: 170#(= ~x~0 0), 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:21,714 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 22:05:21,714 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 22:05:21,715 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 22:05:21,715 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 22:05:21,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [33#L776true, 193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork0InUse, 53#L878true, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, 38#L793true, 27#L806true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:21,716 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 22:05:21,716 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 22:05:21,716 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 22:05:21,716 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 22:05:22,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 53#L878true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, 38#L793true, 27#L806true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, 45#P0EXITtrue, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:22,345 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,345 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,345 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,345 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [33#L776true, 193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, 38#L793true, 27#L806true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 28#L884true, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:22,383 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,384 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,384 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,384 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([407] L884-->L887: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [33#L776true, 193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 38#L793true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#L806true, 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 61#L887true, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 11#L826true, Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:22,384 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,384 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,384 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,385 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 22:05:22,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, 38#L793true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#L806true, 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 28#L884true, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, 45#P0EXITtrue, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:22,860 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,861 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,861 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,861 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([407] L884-->L887: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 38#L793true, 27#L806true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 61#L887true, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 11#L826true, Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, 45#P0EXITtrue, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:22,861 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,861 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,862 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,862 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [30#P1EXITtrue, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, 27#L806true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, 45#P0EXITtrue, Black: 170#(= ~x~0 0), 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:22,908 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,908 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,908 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,908 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [30#P1EXITtrue, 33#L776true, 193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), P0Thread1of1ForFork3InUse, Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 53#L878true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, 27#L806true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:22,909 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,909 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,909 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:22,910 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:05:23,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [30#P1EXITtrue, 193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 53#L878true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#L806true, 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, 45#P0EXITtrue, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:23,538 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,538 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,538 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,538 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [30#P1EXITtrue, 33#L776true, 193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), P0Thread1of1ForFork3InUse, Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#L806true, 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 28#L884true, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:23,571 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,571 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,571 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,572 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([407] L884-->L887: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [30#P1EXITtrue, 33#L776true, 193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), P0Thread1of1ForFork3InUse, Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#L806true, 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 61#L887true, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 11#L826true, Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:23,572 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,572 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,572 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,572 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:05:23,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][58], [30#P1EXITtrue, 193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, 27#L806true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 28#L884true, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, 45#P0EXITtrue, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:23,905 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 22:05:23,906 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:05:23,906 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:05:23,906 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:05:23,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([407] L884-->L887: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [30#P1EXITtrue, 193#true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork3InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 196#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 27#L806true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 124#(and (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t466~0#1.base| |ULTIMATE.start_main_~#t465~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t467~0#1.base| |ULTIMATE.start_main_~#t466~0#1.base|)) (not (= |ULTIMATE.start_main_~#t468~0#1.base| |ULTIMATE.start_main_~#t467~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t465~0#1.base| 0) |ULTIMATE.start_main_~#t466~0#1.base| 0) |ULTIMATE.start_main_~#t468~0#1.base| 0) |ULTIMATE.start_main_~#t467~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 131#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 61#L887true, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 11#L826true, Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 168#true, 45#P0EXITtrue, Black: 170#(= ~x~0 0), 202#true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))))]) [2023-11-24 22:05:23,906 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 22:05:23,906 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:05:23,906 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:05:23,906 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:05:25,794 INFO L124 PetriNetUnfolderBase]: 28686/44673 cut-off events. [2023-11-24 22:05:25,795 INFO L125 PetriNetUnfolderBase]: For 36461/39402 co-relation queries the response was YES. [2023-11-24 22:05:25,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117235 conditions, 44673 events. 28686/44673 cut-off events. For 36461/39402 co-relation queries the response was YES. Maximal size of possible extension queue 2336. Compared 371991 event pairs, 12711 based on Foata normal form. 933/42035 useless extension candidates. Maximal degree in co-relation 117211. Up to 17517 conditions per place. [2023-11-24 22:05:26,081 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 83 selfloop transitions, 10 changer transitions 0/123 dead transitions. [2023-11-24 22:05:26,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 123 transitions, 668 flow [2023-11-24 22:05:26,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 22:05:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 22:05:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2023-11-24 22:05:26,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948051948051948 [2023-11-24 22:05:26,097 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 321 transitions. [2023-11-24 22:05:26,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 321 transitions. [2023-11-24 22:05:26,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:05:26,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 321 transitions. [2023-11-24 22:05:26,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 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-24 22:05:26,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 22:05:26,101 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 22:05:26,101 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 290 flow. Second operand 7 states and 321 transitions. [2023-11-24 22:05:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 123 transitions, 668 flow [2023-11-24 22:05:26,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 662 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-24 22:05:26,162 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 365 flow [2023-11-24 22:05:26,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=365, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2023-11-24 22:05:26,163 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2023-11-24 22:05:26,163 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 365 flow [2023-11-24 22:05:26,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 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-24 22:05:26,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:05:26,163 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] [2023-11-24 22:05:26,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 22:05:26,164 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:05:26,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:05:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2029212644, now seen corresponding path program 1 times [2023-11-24 22:05:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:05:26,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794688082] [2023-11-24 22:05:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:05:26,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:05:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:05:26,344 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-24 22:05:26,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:05:26,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794688082] [2023-11-24 22:05:26,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794688082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:05:26,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:05:26,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:05:26,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850208697] [2023-11-24 22:05:26,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:05:26,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:05:26,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:05:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:05:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:05:26,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-24 22:05:26,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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-24 22:05:26,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:05:26,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-24 22:05:26,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand