./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.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_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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 ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:00:58,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:00:58,552 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 22:00:58,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:00:58,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:00:58,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:00:58,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:00:58,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:00:58,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:00:58,590 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:00:58,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:00:58,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:00:58,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:00:58,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:00:58,593 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:00:58,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:00:58,595 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:00:58,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:00:58,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:00:58,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:00:58,597 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:00:58,598 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:00:58,599 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:00:58,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:00:58,600 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:00:58,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:00:58,601 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:00:58,601 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:00:58,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:00:58,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:00:58,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:00:58,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:00:58,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:00:58,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:00:58,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:00:58,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 22:00:58,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:00:58,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:00:58,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:00:58,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:00:58,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:00:58,608 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_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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 -> ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff [2023-11-24 22:00:58,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:00:59,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:00:59,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:00:59,012 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:00:59,013 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:00:59,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-24 22:01:02,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:01:02,681 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:01:02,681 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-24 22:01:02,711 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/data/2c2133103/a7e0ad8ccdc64ab0b739813ea2209331/FLAG692e3a4fd [2023-11-24 22:01:02,730 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/data/2c2133103/a7e0ad8ccdc64ab0b739813ea2209331 [2023-11-24 22:01:02,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:01:02,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:01:02,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:01:02,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:01:02,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:01:02,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:01:02" (1/1) ... [2023-11-24 22:01:02,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e51121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:02, skipping insertion in model container [2023-11-24 22:01:02,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:01:02" (1/1) ... [2023-11-24 22:01:02,826 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:01:03,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:01:03,333 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:01:03,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:01:03,472 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:01:03,473 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:01:03,483 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:01:03,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03 WrapperNode [2023-11-24 22:01:03,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:01:03,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:01:03,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:01:03,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:01:03,498 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:01:03" (1/1) ... [2023-11-24 22:01:03,544 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:01:03" (1/1) ... [2023-11-24 22:01:03,583 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-24 22:01:03,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:01:03,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:01:03,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:01:03,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:01:03,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,655 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 22:01:03,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:01:03,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:01:03,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:01:03,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:01:03,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (1/1) ... [2023-11-24 22:01:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:01:03,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:01:03,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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:01:03,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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:01:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 22:01:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 22:01:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 22:01:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 22:01:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:01:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:01:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:01:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:01:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:01:03,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:01:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:01:03,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:01:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 22:01:03,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 22:01:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 22:01:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 22:01:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 22:01:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 22:01:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:01:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:01:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:01:03,823 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:01:04,056 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:01:04,060 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:01:04,587 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:01:04,859 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:01:04,859 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:01:04,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:04 BoogieIcfgContainer [2023-11-24 22:01:04,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:01:04,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:01:04,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:01:04,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:01:04,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:01:02" (1/3) ... [2023-11-24 22:01:04,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddbd536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:01:04, skipping insertion in model container [2023-11-24 22:01:04,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:03" (2/3) ... [2023-11-24 22:01:04,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddbd536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:01:04, skipping insertion in model container [2023-11-24 22:01:04,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:04" (3/3) ... [2023-11-24 22:01:04,872 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-24 22:01:04,897 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:01:04,897 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 22:01:04,897 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:01:04,978 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:01:05,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 22:01:05,067 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-24 22:01:05,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:01:05,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-24 22:01:05,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 22:01:05,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-24 22:01:05,088 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:01:05,099 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;@7e70eda9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:01:05,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 22:01:05,108 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:01:05,110 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:01:05,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:01:05,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:05,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:01:05,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:05,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash 12588, now seen corresponding path program 1 times [2023-11-24 22:01:05,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:05,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065554642] [2023-11-24 22:01:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:05,525 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:01:05,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:05,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065554642] [2023-11-24 22:01:05,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065554642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:05,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:05,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459702734] [2023-11-24 22:01:05,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:05,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:05,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:05,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:05,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:01:05,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:05,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:05,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:01:05,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:06,376 INFO L124 PetriNetUnfolderBase]: 1057/2053 cut-off events. [2023-11-24 22:01:06,376 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 22:01:06,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 2053 events. 1057/2053 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13986 event pairs, 791 based on Foata normal form. 120/1966 useless extension candidates. Maximal degree in co-relation 3665. Up to 1193 conditions per place. [2023-11-24 22:01:06,409 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-24 22:01:06,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 185 flow [2023-11-24 22:01:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-24 22:01:06,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-24 22:01:06,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-24 22:01:06,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-24 22:01:06,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:06,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-24 22:01:06,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:06,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:06,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:06,447 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 116 transitions. [2023-11-24 22:01:06,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 185 flow [2023-11-24 22:01:06,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:01:06,466 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-24 22:01:06,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-24 22:01:06,474 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-24 22:01:06,474 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-24 22:01:06,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:06,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:06,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:01:06,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 22:01:06,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:06,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash 12589, now seen corresponding path program 1 times [2023-11-24 22:01:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:06,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721559517] [2023-11-24 22:01:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:06,674 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:01:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:06,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721559517] [2023-11-24 22:01:06,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721559517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:06,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:06,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:06,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609701594] [2023-11-24 22:01:06,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:06,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:06,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:06,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:06,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:06,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:06,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:06,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:07,187 INFO L124 PetriNetUnfolderBase]: 1057/2052 cut-off events. [2023-11-24 22:01:07,187 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 22:01:07,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 2052 events. 1057/2052 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14034 event pairs, 791 based on Foata normal form. 1/1846 useless extension candidates. Maximal degree in co-relation 3725. Up to 1192 conditions per place. [2023-11-24 22:01:07,208 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 22:01:07,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 182 flow [2023-11-24 22:01:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-24 22:01:07,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-24 22:01:07,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-24 22:01:07,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-24 22:01:07,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:07,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-24 22:01:07,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:07,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:07,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:07,224 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 116 transitions. [2023-11-24 22:01:07,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 182 flow [2023-11-24 22:01:07,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:07,231 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-24 22:01:07,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-24 22:01:07,232 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-24 22:01:07,233 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-24 22:01:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:07,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:07,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:01:07,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 22:01:07,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:07,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash 375389224, now seen corresponding path program 1 times [2023-11-24 22:01:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:07,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298199086] [2023-11-24 22:01:07,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:07,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:07,340 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:01:07,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298199086] [2023-11-24 22:01:07,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298199086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:07,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:07,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:07,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427032913] [2023-11-24 22:01:07,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:07,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:07,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:07,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:01:07,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:01:07,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:07,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:01:07,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:07,800 INFO L124 PetriNetUnfolderBase]: 1061/2039 cut-off events. [2023-11-24 22:01:07,800 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 22:01:07,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3732 conditions, 2039 events. 1061/2039 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13871 event pairs, 815 based on Foata normal form. 0/1842 useless extension candidates. Maximal degree in co-relation 3721. Up to 1195 conditions per place. [2023-11-24 22:01:07,824 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-24 22:01:07,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 182 flow [2023-11-24 22:01:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-24 22:01:07,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 22:01:07,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-24 22:01:07,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-24 22:01:07,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:07,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-24 22:01:07,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:07,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:07,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:07,836 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 114 transitions. [2023-11-24 22:01:07,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 182 flow [2023-11-24 22:01:07,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:07,841 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-24 22:01:07,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-24 22:01:07,843 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-24 22:01:07,844 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-24 22:01:07,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:01:07,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:07,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:01:07,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 22:01:07,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:07,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash 375389225, now seen corresponding path program 1 times [2023-11-24 22:01:07,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:07,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612927133] [2023-11-24 22:01:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:08,005 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:01:08,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612927133] [2023-11-24 22:01:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612927133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:08,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:08,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301996470] [2023-11-24 22:01:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:08,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:08,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:08,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:08,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:08,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:08,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:01:08,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:08,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:08,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:08,456 INFO L124 PetriNetUnfolderBase]: 1057/2042 cut-off events. [2023-11-24 22:01:08,457 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-24 22:01:08,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 2042 events. 1057/2042 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14016 event pairs, 571 based on Foata normal form. 5/1853 useless extension candidates. Maximal degree in co-relation 3720. Up to 1186 conditions per place. [2023-11-24 22:01:08,504 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-24 22:01:08,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 178 flow [2023-11-24 22:01:08,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-24 22:01:08,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-24 22:01:08,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-24 22:01:08,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-24 22:01:08,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:08,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-24 22:01:08,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:08,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:08,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:08,509 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 116 transitions. [2023-11-24 22:01:08,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 178 flow [2023-11-24 22:01:08,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:08,512 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-24 22:01:08,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-24 22:01:08,515 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2023-11-24 22:01:08,516 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-24 22:01:08,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:01:08,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:08,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:01:08,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 22:01:08,518 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:08,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash 375389620, now seen corresponding path program 1 times [2023-11-24 22:01:08,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:08,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029040404] [2023-11-24 22:01:08,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:08,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:08,666 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:01:08,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029040404] [2023-11-24 22:01:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029040404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:08,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:08,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:08,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762067706] [2023-11-24 22:01:08,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:08,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:08,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:08,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:08,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:08,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 22:01:08,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:01:08,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:08,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 22:01:08,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:08,985 INFO L124 PetriNetUnfolderBase]: 825/1541 cut-off events. [2023-11-24 22:01:08,985 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-24 22:01:08,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2872 conditions, 1541 events. 825/1541 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9916 event pairs, 129 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 2862. Up to 1009 conditions per place. [2023-11-24 22:01:09,000 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 33 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2023-11-24 22:01:09,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 210 flow [2023-11-24 22:01:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-24 22:01:09,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049 [2023-11-24 22:01:09,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-24 22:01:09,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-24 22:01:09,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:09,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-24 22:01:09,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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:01:09,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:09,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:09,006 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 125 transitions. [2023-11-24 22:01:09,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 210 flow [2023-11-24 22:01:09,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:09,009 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 94 flow [2023-11-24 22:01:09,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-24 22:01:09,010 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 22:01:09,010 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 94 flow [2023-11-24 22:01:09,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:01:09,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:09,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:09,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 22:01:09,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:09,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash -874089373, now seen corresponding path program 1 times [2023-11-24 22:01:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:09,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785131465] [2023-11-24 22:01:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:09,092 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:01:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785131465] [2023-11-24 22:01:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785131465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:09,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713362159] [2023-11-24 22:01:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:09,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:09,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:09,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:01:09,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:01:09,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:09,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:01:09,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:09,412 INFO L124 PetriNetUnfolderBase]: 738/1467 cut-off events. [2023-11-24 22:01:09,412 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-24 22:01:09,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 1467 events. 738/1467 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9586 event pairs, 260 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 2708. Up to 934 conditions per place. [2023-11-24 22:01:09,428 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-24 22:01:09,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 168 flow [2023-11-24 22:01:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-24 22:01:09,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-24 22:01:09,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-24 22:01:09,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-24 22:01:09,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:09,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-24 22:01:09,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:09,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:09,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:09,433 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 94 flow. Second operand 3 states and 111 transitions. [2023-11-24 22:01:09,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 168 flow [2023-11-24 22:01:09,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:09,436 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-24 22:01:09,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-24 22:01:09,437 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-24 22:01:09,437 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-24 22:01:09,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:01:09,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:09,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:09,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 22:01:09,439 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:09,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash -874089372, now seen corresponding path program 1 times [2023-11-24 22:01:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:09,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201896276] [2023-11-24 22:01:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:09,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:01:09,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:09,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201896276] [2023-11-24 22:01:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201896276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:09,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702947693] [2023-11-24 22:01:09,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:09,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:09,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:09,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:09,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:09,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:01:09,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:09,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:09,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:09,803 INFO L124 PetriNetUnfolderBase]: 721/1418 cut-off events. [2023-11-24 22:01:09,803 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-24 22:01:09,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1418 events. 721/1418 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9089 event pairs, 420 based on Foata normal form. 12/1387 useless extension candidates. Maximal degree in co-relation 2595. Up to 905 conditions per place. [2023-11-24 22:01:09,818 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-24 22:01:09,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 162 flow [2023-11-24 22:01:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 22:01:09,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-24 22:01:09,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 22:01:09,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 22:01:09,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:09,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 22:01:09,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:09,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:09,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:09,823 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 113 transitions. [2023-11-24 22:01:09,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 162 flow [2023-11-24 22:01:09,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:09,826 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-24 22:01:09,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-24 22:01:09,827 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-24 22:01:09,827 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-24 22:01:09,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:01:09,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:09,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:09,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 22:01:09,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:09,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:09,829 INFO L85 PathProgramCache]: Analyzing trace with hash -252291527, now seen corresponding path program 1 times [2023-11-24 22:01:09,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:09,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201714532] [2023-11-24 22:01:09,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:09,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:10,410 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:01:10,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:10,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201714532] [2023-11-24 22:01:10,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201714532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:10,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:10,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:01:10,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560493562] [2023-11-24 22:01:10,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:10,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 22:01:10,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:10,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 22:01:10,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 22:01:10,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2023-11-24 22:01:10,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 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:01:10,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:10,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2023-11-24 22:01:10,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:11,024 INFO L124 PetriNetUnfolderBase]: 724/1389 cut-off events. [2023-11-24 22:01:11,024 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-24 22:01:11,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 1389 events. 724/1389 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8700 event pairs, 372 based on Foata normal form. 48/1397 useless extension candidates. Maximal degree in co-relation 2573. Up to 905 conditions per place. [2023-11-24 22:01:11,036 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 26 selfloop transitions, 3 changer transitions 9/55 dead transitions. [2023-11-24 22:01:11,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 196 flow [2023-11-24 22:01:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:01:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:01:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2023-11-24 22:01:11,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2023-11-24 22:01:11,038 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 183 transitions. [2023-11-24 22:01:11,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 183 transitions. [2023-11-24 22:01:11,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:11,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 183 transitions. [2023-11-24 22:01:11,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 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:01:11,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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:01:11,041 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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:01:11,041 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 6 states and 183 transitions. [2023-11-24 22:01:11,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 196 flow [2023-11-24 22:01:11,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:11,043 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 88 flow [2023-11-24 22:01:11,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-11-24 22:01:11,044 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-24 22:01:11,044 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 88 flow [2023-11-24 22:01:11,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 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:01:11,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:11,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:11,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 22:01:11,045 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:11,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash -252290209, now seen corresponding path program 1 times [2023-11-24 22:01:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:11,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686762885] [2023-11-24 22:01:11,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:11,346 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:01:11,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686762885] [2023-11-24 22:01:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686762885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:11,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:11,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:01:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041218165] [2023-11-24 22:01:11,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:11,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:01:11,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:11,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:01:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:01:11,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2023-11-24 22:01:11,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:01:11,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:11,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2023-11-24 22:01:11,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:12,859 INFO L124 PetriNetUnfolderBase]: 4854/7756 cut-off events. [2023-11-24 22:01:12,859 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-24 22:01:12,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14999 conditions, 7756 events. 4854/7756 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 53193 event pairs, 1022 based on Foata normal form. 0/7518 useless extension candidates. Maximal degree in co-relation 14988. Up to 2823 conditions per place. [2023-11-24 22:01:12,912 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 39 selfloop transitions, 6 changer transitions 78/136 dead transitions. [2023-11-24 22:01:12,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 136 transitions, 538 flow [2023-11-24 22:01:12,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 22:01:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 22:01:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 332 transitions. [2023-11-24 22:01:12,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6831275720164609 [2023-11-24 22:01:12,915 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 332 transitions. [2023-11-24 22:01:12,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 332 transitions. [2023-11-24 22:01:12,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:12,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 332 transitions. [2023-11-24 22:01:12,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 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:01:12,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 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:01:12,919 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 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:01:12,919 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 9 states and 332 transitions. [2023-11-24 22:01:12,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 136 transitions, 538 flow [2023-11-24 22:01:12,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 136 transitions, 530 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:01:12,924 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 165 flow [2023-11-24 22:01:12,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=165, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2023-11-24 22:01:12,925 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2023-11-24 22:01:12,926 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 165 flow [2023-11-24 22:01:12,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:01:12,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:12,926 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] [2023-11-24 22:01:12,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 22:01:12,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:12,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash -242803202, now seen corresponding path program 1 times [2023-11-24 22:01:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:12,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137414220] [2023-11-24 22:01:12,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:12,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:13,147 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:01:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137414220] [2023-11-24 22:01:13,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137414220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:13,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:13,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:01:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088559523] [2023-11-24 22:01:13,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:13,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:01:13,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:01:13,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:01:13,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2023-11-24 22:01:13,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:13,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:13,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2023-11-24 22:01:13,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:14,501 INFO L124 PetriNetUnfolderBase]: 3436/5689 cut-off events. [2023-11-24 22:01:14,502 INFO L125 PetriNetUnfolderBase]: For 6029/6034 co-relation queries the response was YES. [2023-11-24 22:01:14,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15599 conditions, 5689 events. 3436/5689 cut-off events. For 6029/6034 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 37946 event pairs, 647 based on Foata normal form. 196/5854 useless extension candidates. Maximal degree in co-relation 15580. Up to 1958 conditions per place. [2023-11-24 22:01:14,541 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 46 selfloop transitions, 6 changer transitions 66/131 dead transitions. [2023-11-24 22:01:14,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 131 transitions, 753 flow [2023-11-24 22:01:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 22:01:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 22:01:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 341 transitions. [2023-11-24 22:01:14,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6314814814814815 [2023-11-24 22:01:14,544 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 341 transitions. [2023-11-24 22:01:14,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 341 transitions. [2023-11-24 22:01:14,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:14,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 341 transitions. [2023-11-24 22:01:14,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 34.1) internal successors, (341), 10 states have internal predecessors, (341), 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:01:14,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 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:01:14,548 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 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:01:14,549 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 165 flow. Second operand 10 states and 341 transitions. [2023-11-24 22:01:14,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 131 transitions, 753 flow [2023-11-24 22:01:14,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 657 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-24 22:01:14,585 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 195 flow [2023-11-24 22:01:14,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=195, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2023-11-24 22:01:14,586 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2023-11-24 22:01:14,586 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 195 flow [2023-11-24 22:01:14,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:14,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:14,587 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:01:14,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 22:01:14,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:14,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash 733414126, now seen corresponding path program 1 times [2023-11-24 22:01:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579521408] [2023-11-24 22:01:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:14,745 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:01:14,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579521408] [2023-11-24 22:01:14,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579521408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:14,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:14,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:01:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770563477] [2023-11-24 22:01:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:14,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:01:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:14,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:01:14,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:01:14,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 22:01:14,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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:01:14,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:14,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 22:01:14,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:15,995 INFO L124 PetriNetUnfolderBase]: 3615/6054 cut-off events. [2023-11-24 22:01:15,995 INFO L125 PetriNetUnfolderBase]: For 5210/6247 co-relation queries the response was YES. [2023-11-24 22:01:16,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14792 conditions, 6054 events. 3615/6054 cut-off events. For 5210/6247 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 40058 event pairs, 535 based on Foata normal form. 263/6106 useless extension candidates. Maximal degree in co-relation 14766. Up to 3147 conditions per place. [2023-11-24 22:01:16,042 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 46 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2023-11-24 22:01:16,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 71 transitions, 380 flow [2023-11-24 22:01:16,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:01:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:01:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2023-11-24 22:01:16,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2023-11-24 22:01:16,045 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 150 transitions. [2023-11-24 22:01:16,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 150 transitions. [2023-11-24 22:01:16,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:16,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 150 transitions. [2023-11-24 22:01:16,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:16,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 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:01:16,047 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 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:01:16,047 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 195 flow. Second operand 4 states and 150 transitions. [2023-11-24 22:01:16,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 71 transitions, 380 flow [2023-11-24 22:01:16,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 359 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-24 22:01:16,084 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 212 flow [2023-11-24 22:01:16,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-11-24 22:01:16,085 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2023-11-24 22:01:16,085 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 212 flow [2023-11-24 22:01:16,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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:01:16,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:16,086 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:01:16,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 22:01:16,086 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:16,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash 546735262, now seen corresponding path program 1 times [2023-11-24 22:01:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:16,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115195170] [2023-11-24 22:01:16,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:16,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:16,374 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:01:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:16,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115195170] [2023-11-24 22:01:16,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115195170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:16,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:16,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:01:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336909104] [2023-11-24 22:01:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:16,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:01:16,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:16,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:01:16,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:01:16,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 22:01:16,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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:01:16,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:16,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 22:01:16,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:17,125 INFO L124 PetriNetUnfolderBase]: 2554/4299 cut-off events. [2023-11-24 22:01:17,125 INFO L125 PetriNetUnfolderBase]: For 2781/3335 co-relation queries the response was YES. [2023-11-24 22:01:17,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11351 conditions, 4299 events. 2554/4299 cut-off events. For 2781/3335 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 26735 event pairs, 342 based on Foata normal form. 214/4344 useless extension candidates. Maximal degree in co-relation 11326. Up to 1277 conditions per place. [2023-11-24 22:01:17,155 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 59 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2023-11-24 22:01:17,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 483 flow [2023-11-24 22:01:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:01:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:01:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-24 22:01:17,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 22:01:17,157 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-24 22:01:17,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-24 22:01:17,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:17,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-24 22:01:17,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 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:01:17,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 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:01:17,159 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 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:01:17,159 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 212 flow. Second operand 5 states and 190 transitions. [2023-11-24 22:01:17,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 483 flow [2023-11-24 22:01:17,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 472 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-24 22:01:17,164 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 256 flow [2023-11-24 22:01:17,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-24 22:01:17,166 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2023-11-24 22:01:17,166 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 256 flow [2023-11-24 22:01:17,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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:01:17,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:17,167 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:01:17,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 22:01:17,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:17,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2108435791, now seen corresponding path program 1 times [2023-11-24 22:01:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:17,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30963526] [2023-11-24 22:01:17,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:17,993 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:01:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30963526] [2023-11-24 22:01:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30963526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 22:01:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389952203] [2023-11-24 22:01:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:17,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 22:01:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:17,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 22:01:17,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-24 22:01:18,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2023-11-24 22:01:18,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 256 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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:01:18,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:18,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2023-11-24 22:01:18,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:19,599 INFO L124 PetriNetUnfolderBase]: 3250/5880 cut-off events. [2023-11-24 22:01:19,599 INFO L125 PetriNetUnfolderBase]: For 7186/8034 co-relation queries the response was YES. [2023-11-24 22:01:19,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17071 conditions, 5880 events. 3250/5880 cut-off events. For 7186/8034 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 42722 event pairs, 623 based on Foata normal form. 168/5659 useless extension candidates. Maximal degree in co-relation 17047. Up to 1576 conditions per place. [2023-11-24 22:01:19,650 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 99 selfloop transitions, 40 changer transitions 19/179 dead transitions. [2023-11-24 22:01:19,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 179 transitions, 1096 flow [2023-11-24 22:01:19,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 22:01:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 22:01:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 407 transitions. [2023-11-24 22:01:19,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-24 22:01:19,654 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 407 transitions. [2023-11-24 22:01:19,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 407 transitions. [2023-11-24 22:01:19,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:19,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 407 transitions. [2023-11-24 22:01:19,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 37.0) internal successors, (407), 11 states have internal predecessors, (407), 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:01:19,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 54.0) internal successors, (648), 12 states have internal predecessors, (648), 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:01:19,659 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 54.0) internal successors, (648), 12 states have internal predecessors, (648), 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:01:19,659 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 256 flow. Second operand 11 states and 407 transitions. [2023-11-24 22:01:19,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 179 transitions, 1096 flow [2023-11-24 22:01:19,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 179 transitions, 1084 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:19,673 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 557 flow [2023-11-24 22:01:19,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=557, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2023-11-24 22:01:19,674 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2023-11-24 22:01:19,675 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 557 flow [2023-11-24 22:01:19,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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:01:19,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:19,675 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:01:19,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 22:01:19,676 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:19,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1721722419, now seen corresponding path program 2 times [2023-11-24 22:01:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:19,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617053998] [2023-11-24 22:01:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:19,986 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:01:19,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:19,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617053998] [2023-11-24 22:01:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617053998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:19,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:19,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:01:19,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449254254] [2023-11-24 22:01:19,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:19,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:01:19,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:19,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:01:19,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:01:19,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 22:01:19,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 557 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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:01:19,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:19,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 22:01:19,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:20,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][41], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, 7#L844true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 53#L785true, 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:20,680 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-24 22:01:20,680 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-24 22:01:20,680 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-24 22:01:20,680 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-24 22:01:20,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 21#L765true, 19#L788true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:20,720 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-24 22:01:20,721 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 22:01:20,721 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 22:01:20,721 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 22:01:20,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][41], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 53#L785true, 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:20,863 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-11-24 22:01:20,864 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-24 22:01:20,864 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-24 22:01:20,864 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-24 22:01:20,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 53#L785true, 43#L814true, 5#P0EXITtrue, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:20,885 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,885 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,885 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,886 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 53#L785true, 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:20,891 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,891 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,891 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,892 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, 19#L788true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:20,916 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,917 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,917 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,917 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 21#L765true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:20,919 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,920 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,921 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,921 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, 19#L788true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 17#L846true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:20,923 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,923 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,923 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,924 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 19#L788true, 48#L768true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:20,925 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,926 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,926 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:20,926 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:01:21,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 53#L785true, 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,071 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,071 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,071 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,071 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 19#L788true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 5#P0EXITtrue, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,073 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,073 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,073 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,073 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:21,078 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,079 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,079 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,079 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:21,095 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,095 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,096 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,096 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, 48#L768true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,097 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,097 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,097 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,097 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 17#L846true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,098 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,098 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,098 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,098 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 48#L768true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,100 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,100 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,100 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,100 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 17#L846true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,101 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,101 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,102 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,102 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 22:01:21,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:21,180 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,180 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,180 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,180 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 5#P0EXITtrue, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,181 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,181 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,181 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,182 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,182 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,183 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,183 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,183 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,187 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,187 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 48#L768true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:21,198 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,198 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,198 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,198 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:21,199 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,199 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,199 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,199 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 17#L846true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:21,201 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,201 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,201 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,201 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:01:21,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,252 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,253 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,253 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,253 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-24 22:01:21,254 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,254 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,254 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,254 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-24 22:01:21,264 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,264 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,264 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,264 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-24 22:01:21,369 INFO L124 PetriNetUnfolderBase]: 3976/6513 cut-off events. [2023-11-24 22:01:21,370 INFO L125 PetriNetUnfolderBase]: For 20345/22224 co-relation queries the response was YES. [2023-11-24 22:01:21,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24262 conditions, 6513 events. 3976/6513 cut-off events. For 20345/22224 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 42991 event pairs, 520 based on Foata normal form. 425/6684 useless extension candidates. Maximal degree in co-relation 24231. Up to 2431 conditions per place. [2023-11-24 22:01:21,431 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 82 selfloop transitions, 11 changer transitions 8/134 dead transitions. [2023-11-24 22:01:21,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 134 transitions, 1056 flow [2023-11-24 22:01:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:01:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:01:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2023-11-24 22:01:21,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2023-11-24 22:01:21,435 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 212 transitions. [2023-11-24 22:01:21,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 212 transitions. [2023-11-24 22:01:21,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:21,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 212 transitions. [2023-11-24 22:01:21,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 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:01:21,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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:01:21,439 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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:01:21,439 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 557 flow. Second operand 6 states and 212 transitions. [2023-11-24 22:01:21,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 134 transitions, 1056 flow [2023-11-24 22:01:21,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 1034 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-24 22:01:21,469 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 550 flow [2023-11-24 22:01:21,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2023-11-24 22:01:21,471 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2023-11-24 22:01:21,471 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 550 flow [2023-11-24 22:01:21,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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:01:21,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:21,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:21,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 22:01:21,472 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:21,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -726354857, now seen corresponding path program 1 times [2023-11-24 22:01:21,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:21,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435938107] [2023-11-24 22:01:21,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:21,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:21,914 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:01:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:21,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435938107] [2023-11-24 22:01:21,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435938107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:21,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:21,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:01:21,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438796842] [2023-11-24 22:01:21,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:21,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:01:21,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:21,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:01:21,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:01:21,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 22:01:21,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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:01:21,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:21,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 22:01:21,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:23,003 INFO L124 PetriNetUnfolderBase]: 2638/5103 cut-off events. [2023-11-24 22:01:23,003 INFO L125 PetriNetUnfolderBase]: For 13794/14908 co-relation queries the response was YES. [2023-11-24 22:01:23,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18357 conditions, 5103 events. 2638/5103 cut-off events. For 13794/14908 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 40287 event pairs, 661 based on Foata normal form. 128/4715 useless extension candidates. Maximal degree in co-relation 18325. Up to 1784 conditions per place. [2023-11-24 22:01:23,043 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 37 selfloop transitions, 1 changer transitions 56/128 dead transitions. [2023-11-24 22:01:23,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 128 transitions, 998 flow [2023-11-24 22:01:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:01:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:01:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2023-11-24 22:01:23,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6265432098765432 [2023-11-24 22:01:23,046 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 203 transitions. [2023-11-24 22:01:23,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 203 transitions. [2023-11-24 22:01:23,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:23,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 203 transitions. [2023-11-24 22:01:23,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 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:01:23,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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:01:23,052 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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:01:23,053 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 550 flow. Second operand 6 states and 203 transitions. [2023-11-24 22:01:23,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 128 transitions, 998 flow [2023-11-24 22:01:23,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 128 transitions, 921 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-11-24 22:01:23,155 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 412 flow [2023-11-24 22:01:23,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2023-11-24 22:01:23,158 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2023-11-24 22:01:23,158 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 412 flow [2023-11-24 22:01:23,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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:01:23,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:23,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:23,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 22:01:23,159 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:23,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 568744081, now seen corresponding path program 2 times [2023-11-24 22:01:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:23,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195529424] [2023-11-24 22:01:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:25,017 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:01:25,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:01:25,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195529424] [2023-11-24 22:01:25,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195529424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:25,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:25,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 22:01:25,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040193656] [2023-11-24 22:01:25,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:25,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 22:01:25,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:01:25,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 22:01:25,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-24 22:01:25,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:01:25,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 412 flow. Second operand has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 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:01:25,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:25,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:01:25,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:26,144 INFO L124 PetriNetUnfolderBase]: 1385/2852 cut-off events. [2023-11-24 22:01:26,144 INFO L125 PetriNetUnfolderBase]: For 4994/5361 co-relation queries the response was YES. [2023-11-24 22:01:26,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9063 conditions, 2852 events. 1385/2852 cut-off events. For 4994/5361 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21197 event pairs, 418 based on Foata normal form. 74/2577 useless extension candidates. Maximal degree in co-relation 9031. Up to 906 conditions per place. [2023-11-24 22:01:26,164 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 43 selfloop transitions, 8 changer transitions 34/118 dead transitions. [2023-11-24 22:01:26,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 795 flow [2023-11-24 22:01:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 22:01:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 22:01:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 315 transitions. [2023-11-24 22:01:26,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2023-11-24 22:01:26,167 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 315 transitions. [2023-11-24 22:01:26,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 315 transitions. [2023-11-24 22:01:26,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:26,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 315 transitions. [2023-11-24 22:01:26,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 35.0) internal successors, (315), 9 states have internal predecessors, (315), 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:01:26,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 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:01:26,171 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 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:01:26,172 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 412 flow. Second operand 9 states and 315 transitions. [2023-11-24 22:01:26,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 795 flow [2023-11-24 22:01:26,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 118 transitions, 740 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-11-24 22:01:26,198 INFO L231 Difference]: Finished difference. Result has 88 places, 62 transitions, 378 flow [2023-11-24 22:01:26,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=88, PETRI_TRANSITIONS=62} [2023-11-24 22:01:26,199 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 29 predicate places. [2023-11-24 22:01:26,200 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 62 transitions, 378 flow [2023-11-24 22:01:26,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 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:01:26,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:26,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:26,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 22:01:26,201 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:26,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash -812600905, now seen corresponding path program 3 times [2023-11-24 22:01:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:01:26,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067944122] [2023-11-24 22:01:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:01:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:01:26,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:01:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:01:26,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 22:01:26,396 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:01:26,398 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 22:01:26,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 22:01:26,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 22:01:26,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 22:01:26,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 22:01:26,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 22:01:26,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 22:01:26,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 22:01:26,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 22:01:26,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 22:01:26,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 22:01:26,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 22:01:26,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 22:01:26,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 22:01:26,406 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:26,414 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 22:01:26,415 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:01:26,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 22:01:26,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 22:01:26,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 22:01:26,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:01:26,552 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:01:26,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:01:26 BasicIcfg [2023-11-24 22:01:26,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:01:26,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:01:26,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:01:26,578 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:01:26,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:04" (3/4) ... [2023-11-24 22:01:26,581 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:01:26,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:01:26,583 INFO L158 Benchmark]: Toolchain (without parser) took 23841.72ms. Allocated memory was 138.4MB in the beginning and 931.1MB in the end (delta: 792.7MB). Free memory was 94.9MB in the beginning and 736.4MB in the end (delta: -641.5MB). Peak memory consumption was 152.3MB. Max. memory is 16.1GB. [2023-11-24 22:01:26,584 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 138.4MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:01:26,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 738.39ms. Allocated memory is still 138.4MB. Free memory was 94.9MB in the beginning and 71.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 22:01:26,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.46ms. Allocated memory is still 138.4MB. Free memory was 71.3MB in the beginning and 68.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:01:26,586 INFO L158 Benchmark]: Boogie Preprocessor took 123.45ms. Allocated memory is still 138.4MB. Free memory was 68.7MB in the beginning and 65.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 22:01:26,586 INFO L158 Benchmark]: RCFGBuilder took 1150.97ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 65.0MB in the beginning and 127.8MB in the end (delta: -62.7MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2023-11-24 22:01:26,587 INFO L158 Benchmark]: TraceAbstraction took 21713.01ms. Allocated memory was 186.6MB in the beginning and 931.1MB in the end (delta: 744.5MB). Free memory was 126.7MB in the beginning and 736.4MB in the end (delta: -609.7MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. [2023-11-24 22:01:26,587 INFO L158 Benchmark]: Witness Printer took 5.47ms. Allocated memory is still 931.1MB. Free memory is still 736.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:01:26,591 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 138.4MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 738.39ms. Allocated memory is still 138.4MB. Free memory was 94.9MB in the beginning and 71.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.46ms. Allocated memory is still 138.4MB. Free memory was 71.3MB in the beginning and 68.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.45ms. Allocated memory is still 138.4MB. Free memory was 68.7MB in the beginning and 65.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1150.97ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 65.0MB in the beginning and 127.8MB in the end (delta: -62.7MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 21713.01ms. Allocated memory was 186.6MB in the beginning and 931.1MB in the end (delta: 744.5MB). Free memory was 126.7MB in the beginning and 736.4MB in the end (delta: -609.7MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. * Witness Printer took 5.47ms. Allocated memory is still 931.1MB. Free memory is still 736.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t657; [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t658; [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t659; [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 79 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 821 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 714 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2330 IncrementalHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 63 mSDtfsCounter, 2330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=13, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 2126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-24 22:01:26,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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 ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:01:29,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:01:29,788 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 22:01:29,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:01:29,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:01:29,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:01:29,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:01:29,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:01:29,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:01:29,858 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:01:29,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:01:29,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:01:29,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:01:29,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:01:29,863 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:01:29,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:01:29,864 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:01:29,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:01:29,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:01:29,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:01:29,866 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:01:29,867 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:01:29,867 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:01:29,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:01:29,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:01:29,869 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 22:01:29,869 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 22:01:29,870 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:01:29,870 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:01:29,871 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:01:29,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:01:29,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:01:29,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:01:29,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:01:29,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:01:29,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:01:29,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:01:29,876 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 22:01:29,876 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 22:01:29,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:01:29,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:01:29,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:01:29,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:01:29,877 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 22:01:29,878 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_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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 -> ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff [2023-11-24 22:01:30,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:01:30,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:01:30,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:01:30,332 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:01:30,332 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:01:30,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-24 22:01:33,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:01:34,227 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:01:34,228 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-24 22:01:34,259 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/data/bb0810be4/f9bd9d63c7ba4fb5b164bd2ee4e1dddc/FLAGf1c02b659 [2023-11-24 22:01:34,280 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/data/bb0810be4/f9bd9d63c7ba4fb5b164bd2ee4e1dddc [2023-11-24 22:01:34,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:01:34,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:01:34,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:01:34,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:01:34,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:01:34,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:01:34" (1/1) ... [2023-11-24 22:01:34,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@353ab811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:34, skipping insertion in model container [2023-11-24 22:01:34,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:01:34" (1/1) ... [2023-11-24 22:01:34,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:01:34,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:01:34,937 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:01:35,053 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:01:35,140 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:01:35,140 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:01:35,149 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:01:35,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35 WrapperNode [2023-11-24 22:01:35,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:01:35,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:01:35,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:01:35,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:01:35,161 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:01:35" (1/1) ... [2023-11-24 22:01:35,184 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:01:35" (1/1) ... [2023-11-24 22:01:35,224 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-24 22:01:35,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:01:35,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:01:35,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:01:35,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:01:35,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,287 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 22:01:35,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:01:35,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:01:35,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:01:35,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:01:35,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (1/1) ... [2023-11-24 22:01:35,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:01:35,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:01:35,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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:01:35,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/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:01:35,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:01:35,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:01:35,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:01:35,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:01:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 22:01:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 22:01:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 22:01:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-24 22:01:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 22:01:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 22:01:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 22:01:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-24 22:01:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:01:35,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:01:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:01:35,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:01:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 22:01:35,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 22:01:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:01:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:01:35,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:01:35,482 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:01:35,683 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:01:35,685 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:01:36,196 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:01:36,482 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:01:36,482 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:01:36,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:36 BoogieIcfgContainer [2023-11-24 22:01:36,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:01:36,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:01:36,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:01:36,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:01:36,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:01:34" (1/3) ... [2023-11-24 22:01:36,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b48c918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:01:36, skipping insertion in model container [2023-11-24 22:01:36,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:01:35" (2/3) ... [2023-11-24 22:01:36,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b48c918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:01:36, skipping insertion in model container [2023-11-24 22:01:36,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:01:36" (3/3) ... [2023-11-24 22:01:36,497 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-24 22:01:36,520 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:01:36,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 22:01:36,520 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:01:36,620 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:01:36,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 22:01:36,704 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-24 22:01:36,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:01:36,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-24 22:01:36,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-24 22:01:36,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-24 22:01:36,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:01:36,738 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;@25599415, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:01:36,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 22:01:36,744 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:01:36,744 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:01:36,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:01:36,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:36,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:01:36,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:36,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash 12652, now seen corresponding path program 1 times [2023-11-24 22:01:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284770963] [2023-11-24 22:01:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:36,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:36,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:36,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:36,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-24 22:01:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:36,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:01:36,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:37,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 22:01:37,050 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:01:37,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:37,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:37,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284770963] [2023-11-24 22:01:37,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284770963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:37,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:37,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284103953] [2023-11-24 22:01:37,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:37,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:37,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:01:37,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:37,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:37,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:01:37,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:37,773 INFO L124 PetriNetUnfolderBase]: 1057/2053 cut-off events. [2023-11-24 22:01:37,774 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 22:01:37,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 2053 events. 1057/2053 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13860 event pairs, 791 based on Foata normal form. 120/1967 useless extension candidates. Maximal degree in co-relation 3665. Up to 1193 conditions per place. [2023-11-24 22:01:37,819 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-24 22:01:37,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 185 flow [2023-11-24 22:01:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-24 22:01:37,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-24 22:01:37,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-24 22:01:37,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-24 22:01:37,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:37,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-24 22:01:37,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:37,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:37,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:37,847 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 116 transitions. [2023-11-24 22:01:37,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 185 flow [2023-11-24 22:01:37,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:01:37,855 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-24 22:01:37,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-24 22:01:37,860 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-24 22:01:37,861 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-24 22:01:37,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:37,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:37,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:01:37,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-24 22:01:38,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:38,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:38,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash 12653, now seen corresponding path program 1 times [2023-11-24 22:01:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:38,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081038681] [2023-11-24 22:01:38,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:38,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:38,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:38,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:38,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-24 22:01:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:38,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:01:38,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:38,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 22:01:38,178 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:01:38,178 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:38,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:38,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081038681] [2023-11-24 22:01:38,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081038681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:38,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:38,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:38,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397588890] [2023-11-24 22:01:38,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:38,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:38,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:38,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:38,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:38,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:38,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:38,705 INFO L124 PetriNetUnfolderBase]: 1057/2052 cut-off events. [2023-11-24 22:01:38,705 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 22:01:38,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 2052 events. 1057/2052 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13883 event pairs, 791 based on Foata normal form. 1/1847 useless extension candidates. Maximal degree in co-relation 3725. Up to 1192 conditions per place. [2023-11-24 22:01:38,726 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 22:01:38,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 182 flow [2023-11-24 22:01:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-24 22:01:38,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-24 22:01:38,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-24 22:01:38,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-24 22:01:38,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:38,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-24 22:01:38,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:38,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:38,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:38,742 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 116 transitions. [2023-11-24 22:01:38,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 182 flow [2023-11-24 22:01:38,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:38,749 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-24 22:01:38,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-24 22:01:38,751 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-24 22:01:38,751 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-24 22:01:38,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:38,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:38,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:01:38,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-24 22:01:38,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:38,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:38,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 377294386, now seen corresponding path program 1 times [2023-11-24 22:01:38,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:38,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351049886] [2023-11-24 22:01:38,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:38,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:38,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:38,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:38,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-24 22:01:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:39,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:01:39,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:39,063 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:01:39,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:39,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:39,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351049886] [2023-11-24 22:01:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351049886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:39,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:39,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:01:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766424036] [2023-11-24 22:01:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:39,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:39,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:39,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 22:01:39,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:01:39,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:39,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 22:01:39,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:39,391 INFO L124 PetriNetUnfolderBase]: 825/1466 cut-off events. [2023-11-24 22:01:39,391 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-24 22:01:39,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 1466 events. 825/1466 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8571 event pairs, 457 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 2783. Up to 1009 conditions per place. [2023-11-24 22:01:39,404 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 33 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2023-11-24 22:01:39,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 212 flow [2023-11-24 22:01:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-24 22:01:39,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049 [2023-11-24 22:01:39,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-24 22:01:39,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-24 22:01:39,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:39,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-24 22:01:39,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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:01:39,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:39,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:39,416 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 125 transitions. [2023-11-24 22:01:39,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 212 flow [2023-11-24 22:01:39,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:39,421 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 98 flow [2023-11-24 22:01:39,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-11-24 22:01:39,423 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-24 22:01:39,423 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 98 flow [2023-11-24 22:01:39,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:01:39,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:39,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:01:39,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-24 22:01:39,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:39,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:39,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash 377293990, now seen corresponding path program 1 times [2023-11-24 22:01:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:39,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075943433] [2023-11-24 22:01:39,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:39,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:39,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:39,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:39,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-24 22:01:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:39,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:01:39,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:39,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 22:01:39,759 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:01:39,759 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:39,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:39,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075943433] [2023-11-24 22:01:39,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075943433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:39,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:39,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844993806] [2023-11-24 22:01:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:39,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:39,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:39,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:39,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:01:39,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:01:39,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:39,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:01:39,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:40,087 INFO L124 PetriNetUnfolderBase]: 724/1452 cut-off events. [2023-11-24 22:01:40,087 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-24 22:01:40,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 1452 events. 724/1452 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9606 event pairs, 550 based on Foata normal form. 0/1381 useless extension candidates. Maximal degree in co-relation 2669. Up to 940 conditions per place. [2023-11-24 22:01:40,102 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-24 22:01:40,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-24 22:01:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-24 22:01:40,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-24 22:01:40,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-24 22:01:40,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-24 22:01:40,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:40,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-24 22:01:40,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:40,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:40,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:40,108 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 98 flow. Second operand 3 states and 111 transitions. [2023-11-24 22:01:40,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-24 22:01:40,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:40,110 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-24 22:01:40,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-24 22:01:40,112 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 22:01:40,112 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-24 22:01:40,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:01:40,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:40,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:01:40,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 22:01:40,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:40,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:40,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 377293991, now seen corresponding path program 1 times [2023-11-24 22:01:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:40,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172685201] [2023-11-24 22:01:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:40,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:40,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:40,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:40,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-24 22:01:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:40,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:01:40,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:40,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 22:01:40,463 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:01:40,463 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:40,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:40,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172685201] [2023-11-24 22:01:40,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172685201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:40,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:40,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:40,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346241805] [2023-11-24 22:01:40,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:40,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:40,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:40,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:40,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:40,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:01:40,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:40,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:40,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:40,828 INFO L124 PetriNetUnfolderBase]: 721/1462 cut-off events. [2023-11-24 22:01:40,828 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-24 22:01:40,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 1462 events. 721/1462 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9619 event pairs, 416 based on Foata normal form. 4/1394 useless extension candidates. Maximal degree in co-relation 2631. Up to 933 conditions per place. [2023-11-24 22:01:40,844 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-24 22:01:40,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 166 flow [2023-11-24 22:01:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 22:01:40,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-24 22:01:40,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 22:01:40,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 22:01:40,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:40,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 22:01:40,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:40,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:40,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:40,850 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 113 transitions. [2023-11-24 22:01:40,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 166 flow [2023-11-24 22:01:40,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:40,854 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-24 22:01:40,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-24 22:01:40,857 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-24 22:01:40,858 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-24 22:01:40,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:01:40,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:40,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:40,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-24 22:01:41,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:41,062 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:41,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash 36223593, now seen corresponding path program 1 times [2023-11-24 22:01:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:41,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563600159] [2023-11-24 22:01:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:41,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:41,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:41,065 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:41,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-24 22:01:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:41,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:01:41,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:41,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 22:01:41,227 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:01:41,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:41,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:41,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563600159] [2023-11-24 22:01:41,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563600159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:41,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:41,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335227899] [2023-11-24 22:01:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:41,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:41,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:41,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:41,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-24 22:01:41,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:01:41,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:41,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-24 22:01:41,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:41,628 INFO L124 PetriNetUnfolderBase]: 738/1467 cut-off events. [2023-11-24 22:01:41,628 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-24 22:01:41,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1467 events. 738/1467 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9575 event pairs, 260 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 2665. Up to 934 conditions per place. [2023-11-24 22:01:41,644 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-24 22:01:41,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 166 flow [2023-11-24 22:01:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-24 22:01:41,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-24 22:01:41,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-24 22:01:41,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-24 22:01:41,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:41,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-24 22:01:41,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:41,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:41,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:41,651 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 111 transitions. [2023-11-24 22:01:41,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 166 flow [2023-11-24 22:01:41,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:41,655 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-24 22:01:41,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-24 22:01:41,659 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-24 22:01:41,660 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-24 22:01:41,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:01:41,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:41,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:41,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-24 22:01:41,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:41,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:41,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash 36223594, now seen corresponding path program 1 times [2023-11-24 22:01:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70295305] [2023-11-24 22:01:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:41,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:41,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:41,867 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:41,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-24 22:01:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:41,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:01:41,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:41,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 22:01:41,998 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:01:41,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:41,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:41,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70295305] [2023-11-24 22:01:41,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70295305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:41,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:01:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130212541] [2023-11-24 22:01:42,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:42,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:01:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:42,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:01:42,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:01:42,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 22:01:42,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:01:42,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:42,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 22:01:42,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:42,345 INFO L124 PetriNetUnfolderBase]: 721/1418 cut-off events. [2023-11-24 22:01:42,345 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-24 22:01:42,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1418 events. 721/1418 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9117 event pairs, 420 based on Foata normal form. 12/1388 useless extension candidates. Maximal degree in co-relation 2595. Up to 905 conditions per place. [2023-11-24 22:01:42,361 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-24 22:01:42,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 162 flow [2023-11-24 22:01:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:01:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:01:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 22:01:42,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-24 22:01:42,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 22:01:42,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 22:01:42,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:42,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 22:01:42,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:42,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:42,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:01:42,366 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 113 transitions. [2023-11-24 22:01:42,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 162 flow [2023-11-24 22:01:42,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:42,369 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-24 22:01:42,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-24 22:01:42,370 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-24 22:01:42,370 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-24 22:01:42,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:01:42,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:42,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:01:42,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-24 22:01:42,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:42,574 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:42,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:42,575 INFO L85 PathProgramCache]: Analyzing trace with hash -105279427, now seen corresponding path program 1 times [2023-11-24 22:01:42,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:42,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805771341] [2023-11-24 22:01:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:42,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:42,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:42,577 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:42,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-24 22:01:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:42,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:01:42,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:42,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:01:42,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:42,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:42,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805771341] [2023-11-24 22:01:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805771341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:42,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:42,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:01:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449375653] [2023-11-24 22:01:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:42,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:01:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:42,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:01:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:01:42,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 22:01:42,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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:01:42,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:42,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 22:01:42,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:43,244 INFO L124 PetriNetUnfolderBase]: 1680/2972 cut-off events. [2023-11-24 22:01:43,245 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-24 22:01:43,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5652 conditions, 2972 events. 1680/2972 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19302 event pairs, 188 based on Foata normal form. 100/3024 useless extension candidates. Maximal degree in co-relation 5642. Up to 1579 conditions per place. [2023-11-24 22:01:43,269 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 43 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2023-11-24 22:01:43,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 244 flow [2023-11-24 22:01:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:01:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:01:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-11-24 22:01:43,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6990740740740741 [2023-11-24 22:01:43,271 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 151 transitions. [2023-11-24 22:01:43,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 151 transitions. [2023-11-24 22:01:43,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:43,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 151 transitions. [2023-11-24 22:01:43,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:01:43,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 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:01:43,274 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 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:01:43,274 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 4 states and 151 transitions. [2023-11-24 22:01:43,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 244 flow [2023-11-24 22:01:43,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:43,279 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 120 flow [2023-11-24 22:01:43,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-24 22:01:43,280 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-24 22:01:43,280 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 120 flow [2023-11-24 22:01:43,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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:01:43,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:43,281 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:01:43,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-24 22:01:43,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:43,484 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:43,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1510135982, now seen corresponding path program 1 times [2023-11-24 22:01:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:43,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725507350] [2023-11-24 22:01:43,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:43,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:43,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:43,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:43,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-24 22:01:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:01:43,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:01:43,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:01:43,708 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:01:43,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:01:43,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:01:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725507350] [2023-11-24 22:01:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725507350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:01:43,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:01:43,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:01:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390240623] [2023-11-24 22:01:43,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:01:43,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:01:43,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:01:43,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:01:43,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:01:43,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-24 22:01:43,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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:01:43,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:01:43,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-24 22:01:43,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:01:44,145 INFO L124 PetriNetUnfolderBase]: 1038/1850 cut-off events. [2023-11-24 22:01:44,146 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2023-11-24 22:01:44,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 1850 events. 1038/1850 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10478 event pairs, 100 based on Foata normal form. 82/1892 useless extension candidates. Maximal degree in co-relation 4070. Up to 697 conditions per place. [2023-11-24 22:01:44,159 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 54 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2023-11-24 22:01:44,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 339 flow [2023-11-24 22:01:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:01:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:01:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-24 22:01:44,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 22:01:44,161 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-24 22:01:44,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-24 22:01:44,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:01:44,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-24 22:01:44,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 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:01:44,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 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:01:44,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 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:01:44,164 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 120 flow. Second operand 5 states and 190 transitions. [2023-11-24 22:01:44,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 339 flow [2023-11-24 22:01:44,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 329 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 22:01:44,168 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 160 flow [2023-11-24 22:01:44,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-24 22:01:44,169 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-24 22:01:44,170 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 160 flow [2023-11-24 22:01:44,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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:01:44,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:01:44,170 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] [2023-11-24 22:01:44,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-24 22:01:44,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:44,373 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:01:44,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:01:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1168736958, now seen corresponding path program 1 times [2023-11-24 22:01:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:01:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909444851] [2023-11-24 22:01:44,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:01:44,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:01:44,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:01:44,375 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:01:44,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f654d9f3-a1c5-4e2d-a42a-163f8e472c00/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process