./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:01:05,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:01:05,792 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:01:05,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:01:05,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:01:05,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:01:05,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:01:05,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:01:05,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:01:05,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:01:05,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:01:05,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:01:05,857 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:01:05,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:01:05,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:01:05,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:01:05,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:01:05,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:01:05,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:01:05,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:01:05,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:01:05,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:01:05,864 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:01:05,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:01:05,865 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:01:05,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:01:05,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:01:05,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:01:05,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:01:05,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:01:05,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:01:05,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:01:05,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:01:05,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:01:05,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:01:05,881 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:01:05,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:01:05,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:01:05,882 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:01:05,882 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_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/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_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! call(reach_error())) ) 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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 [2023-11-06 23:01:06,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:01:06,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:01:06,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:01:06,265 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:01:06,266 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:01:06,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-06 23:01:09,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:01:09,763 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:01:09,763 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-06 23:01:09,785 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/data/98be2387c/8e9632a840e840ed98c8feb69a0f46cb/FLAGbea91baf9 [2023-11-06 23:01:09,807 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/data/98be2387c/8e9632a840e840ed98c8feb69a0f46cb [2023-11-06 23:01:09,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:01:09,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:01:09,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:09,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:01:09,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:01:09,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:09" (1/1) ... [2023-11-06 23:01:09,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:09, skipping insertion in model container [2023-11-06 23:01:09,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:09" (1/1) ... [2023-11-06 23:01:09,908 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:01:10,098 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i[949,962] [2023-11-06 23:01:10,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:10,431 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:01:10,446 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i[949,962] [2023-11-06 23:01:10,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:10,625 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:01:10,625 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:01:10,668 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:01:10,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10 WrapperNode [2023-11-06 23:01:10,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:10,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:10,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:01:10,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:01:10,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,781 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-11-06 23:01:10,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:10,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:01:10,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:01:10,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:01:10,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:01:10,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:01:10,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:01:10,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:01:10,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:01:10,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:10,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:01:10,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:01:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:01:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:01:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:01:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:01:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:01:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:01:10,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:01:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:01:10,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:01:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:01:10,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:01:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 23:01:10,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 23:01:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:01:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:01:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:01:10,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:01:10,982 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:01:11,145 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:01:11,147 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:01:11,614 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:01:11,806 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:01:11,807 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:01:11,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:11 BoogieIcfgContainer [2023-11-06 23:01:11,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:01:11,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:01:11,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:01:11,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:01:11,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:01:09" (1/3) ... [2023-11-06 23:01:11,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ac3baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:01:11, skipping insertion in model container [2023-11-06 23:01:11,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10" (2/3) ... [2023-11-06 23:01:11,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ac3baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:01:11, skipping insertion in model container [2023-11-06 23:01:11,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:11" (3/3) ... [2023-11-06 23:01:11,822 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-11-06 23:01:11,833 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 23:01:11,856 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:01:11,856 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 23:01:11,856 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:01:11,935 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:01:11,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 288 flow [2023-11-06 23:01:12,103 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-06 23:01:12,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:01:12,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-06 23:01:12,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 288 flow [2023-11-06 23:01:12,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2023-11-06 23:01:12,126 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:01:12,136 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-06 23:01:12,139 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-06 23:01:12,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2023-11-06 23:01:12,194 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-06 23:01:12,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:01:12,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-06 23:01:12,202 INFO L119 LiptonReduction]: Number of co-enabled transitions 3520 [2023-11-06 23:01:18,082 INFO L134 LiptonReduction]: Checked pairs total: 10140 [2023-11-06 23:01:18,082 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-11-06 23:01:18,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:01:18,124 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@159b8cbd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:01:18,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 23:01:18,135 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:01:18,135 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-06 23:01:18,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:01:18,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:18,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:01:18,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:18,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:18,144 INFO L85 PathProgramCache]: Analyzing trace with hash 542466650, now seen corresponding path program 1 times [2023-11-06 23:01:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:18,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124425655] [2023-11-06 23:01:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:18,742 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-06 23:01:18,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:18,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124425655] [2023-11-06 23:01:18,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124425655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:18,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:01:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900663287] [2023-11-06 23:01:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:18,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:01:18,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:18,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:18,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 245 [2023-11-06 23:01:18,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:18,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:18,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 245 [2023-11-06 23:01:18,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:20,230 INFO L124 PetriNetUnfolderBase]: 4695/6889 cut-off events. [2023-11-06 23:01:20,231 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-06 23:01:20,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13465 conditions, 6889 events. 4695/6889 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 41124 event pairs, 861 based on Foata normal form. 0/6560 useless extension candidates. Maximal degree in co-relation 13453. Up to 5107 conditions per place. [2023-11-06 23:01:20,301 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 39 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-06 23:01:20,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 202 flow [2023-11-06 23:01:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:01:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-11-06 23:01:20,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2023-11-06 23:01:20,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-11-06 23:01:20,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-11-06 23:01:20,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:20,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-11-06 23:01:20,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,339 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 406 transitions. [2023-11-06 23:01:20,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 202 flow [2023-11-06 23:01:20,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:01:20,346 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 72 flow [2023-11-06 23:01:20,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-11-06 23:01:20,352 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-06 23:01:20,353 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 72 flow [2023-11-06 23:01:20,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:20,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:20,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:01:20,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:20,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1834961544, now seen corresponding path program 1 times [2023-11-06 23:01:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:20,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989617840] [2023-11-06 23:01:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:20,801 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-06 23:01:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989617840] [2023-11-06 23:01:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989617840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952500725] [2023-11-06 23:01:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:20,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:20,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-11-06 23:01:20,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:20,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-11-06 23:01:20,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:22,227 INFO L124 PetriNetUnfolderBase]: 4855/6996 cut-off events. [2023-11-06 23:01:22,227 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2023-11-06 23:01:22,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14314 conditions, 6996 events. 4855/6996 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 38803 event pairs, 1527 based on Foata normal form. 320/7263 useless extension candidates. Maximal degree in co-relation 14304. Up to 3761 conditions per place. [2023-11-06 23:01:22,286 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 34 selfloop transitions, 2 changer transitions 23/64 dead transitions. [2023-11-06 23:01:22,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 264 flow [2023-11-06 23:01:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:01:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-11-06 23:01:22,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151020408163265 [2023-11-06 23:01:22,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-11-06 23:01:22,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-11-06 23:01:22,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:22,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-11-06 23:01:22,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:22,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:22,309 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:22,309 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 5 states and 631 transitions. [2023-11-06 23:01:22,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 264 flow [2023-11-06 23:01:22,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:01:22,315 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 80 flow [2023-11-06 23:01:22,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-11-06 23:01:22,321 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-11-06 23:01:22,321 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 80 flow [2023-11-06 23:01:22,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:22,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:22,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:22,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:01:22,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:22,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:22,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1904030507, now seen corresponding path program 1 times [2023-11-06 23:01:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:22,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571387883] [2023-11-06 23:01:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:22,662 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-06 23:01:22,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:22,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571387883] [2023-11-06 23:01:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571387883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:22,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:22,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318720350] [2023-11-06 23:01:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:22,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:22,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-11-06 23:01:22,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:22,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:22,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-11-06 23:01:22,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:24,063 INFO L124 PetriNetUnfolderBase]: 4415/6511 cut-off events. [2023-11-06 23:01:24,063 INFO L125 PetriNetUnfolderBase]: For 880/928 co-relation queries the response was YES. [2023-11-06 23:01:24,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13480 conditions, 6511 events. 4415/6511 cut-off events. For 880/928 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 36480 event pairs, 1303 based on Foata normal form. 256/6713 useless extension candidates. Maximal degree in co-relation 13467. Up to 3697 conditions per place. [2023-11-06 23:01:24,127 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 36 selfloop transitions, 2 changer transitions 21/64 dead transitions. [2023-11-06 23:01:24,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 270 flow [2023-11-06 23:01:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:01:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-11-06 23:01:24,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151020408163265 [2023-11-06 23:01:24,131 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-11-06 23:01:24,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-11-06 23:01:24,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:24,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-11-06 23:01:24,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:24,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:24,141 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:24,141 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 80 flow. Second operand 5 states and 631 transitions. [2023-11-06 23:01:24,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 270 flow [2023-11-06 23:01:24,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 64 transitions, 262 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 23:01:24,176 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 84 flow [2023-11-06 23:01:24,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-11-06 23:01:24,178 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-11-06 23:01:24,182 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 84 flow [2023-11-06 23:01:24,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:24,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:24,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:24,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:01:24,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:24,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1903645255, now seen corresponding path program 1 times [2023-11-06 23:01:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:24,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138790043] [2023-11-06 23:01:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:24,803 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-06 23:01:24,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:24,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138790043] [2023-11-06 23:01:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138790043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:24,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:24,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:24,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568518246] [2023-11-06 23:01:24,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:24,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:01:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:24,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:01:24,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:24,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-11-06 23:01:24,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:24,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:24,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-11-06 23:01:24,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:26,056 INFO L124 PetriNetUnfolderBase]: 4322/6337 cut-off events. [2023-11-06 23:01:26,057 INFO L125 PetriNetUnfolderBase]: For 1208/1218 co-relation queries the response was YES. [2023-11-06 23:01:26,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13258 conditions, 6337 events. 4322/6337 cut-off events. For 1208/1218 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 35996 event pairs, 965 based on Foata normal form. 184/6461 useless extension candidates. Maximal degree in co-relation 13244. Up to 5155 conditions per place. [2023-11-06 23:01:26,105 INFO L140 encePairwiseOnDemand]: 240/245 looper letters, 39 selfloop transitions, 3 changer transitions 19/66 dead transitions. [2023-11-06 23:01:26,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 288 flow [2023-11-06 23:01:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:01:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2023-11-06 23:01:26,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516734693877551 [2023-11-06 23:01:26,109 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2023-11-06 23:01:26,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2023-11-06 23:01:26,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:26,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2023-11-06 23:01:26,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:26,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:26,117 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:26,118 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 84 flow. Second operand 5 states and 633 transitions. [2023-11-06 23:01:26,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 288 flow [2023-11-06 23:01:26,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 280 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 23:01:26,148 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 103 flow [2023-11-06 23:01:26,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-11-06 23:01:26,149 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-11-06 23:01:26,149 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 103 flow [2023-11-06 23:01:26,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:26,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:26,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:26,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:01:26,151 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:26,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1627454872, now seen corresponding path program 1 times [2023-11-06 23:01:26,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:26,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691237893] [2023-11-06 23:01:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:28,101 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-06 23:01:28,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:28,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691237893] [2023-11-06 23:01:28,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691237893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:28,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:28,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:28,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179560907] [2023-11-06 23:01:28,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:28,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:28,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:28,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 245 [2023-11-06 23:01:28,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:28,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:28,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 245 [2023-11-06 23:01:28,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:30,617 INFO L124 PetriNetUnfolderBase]: 13418/18090 cut-off events. [2023-11-06 23:01:30,618 INFO L125 PetriNetUnfolderBase]: For 7374/7374 co-relation queries the response was YES. [2023-11-06 23:01:30,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43301 conditions, 18090 events. 13418/18090 cut-off events. For 7374/7374 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 90696 event pairs, 1655 based on Foata normal form. 429/18519 useless extension candidates. Maximal degree in co-relation 43286. Up to 14887 conditions per place. [2023-11-06 23:01:30,727 INFO L140 encePairwiseOnDemand]: 231/245 looper letters, 61 selfloop transitions, 13 changer transitions 26/100 dead transitions. [2023-11-06 23:01:30,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 100 transitions, 485 flow [2023-11-06 23:01:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:01:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:01:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2023-11-06 23:01:30,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2023-11-06 23:01:30,731 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 702 transitions. [2023-11-06 23:01:30,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 702 transitions. [2023-11-06 23:01:30,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:30,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 702 transitions. [2023-11-06 23:01:30,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:30,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:30,739 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:30,739 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 103 flow. Second operand 6 states and 702 transitions. [2023-11-06 23:01:30,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 100 transitions, 485 flow [2023-11-06 23:01:30,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 100 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:01:30,806 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 202 flow [2023-11-06 23:01:30,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-06 23:01:30,809 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-06 23:01:30,809 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 202 flow [2023-11-06 23:01:30,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:30,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:30,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:30,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:01:30,810 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:30,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:30,811 INFO L85 PathProgramCache]: Analyzing trace with hash -362403868, now seen corresponding path program 2 times [2023-11-06 23:01:30,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:30,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973733332] [2023-11-06 23:01:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:31,737 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-06 23:01:31,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:31,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973733332] [2023-11-06 23:01:31,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973733332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:31,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:31,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:31,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808509646] [2023-11-06 23:01:31,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:31,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:31,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:31,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:31,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2023-11-06 23:01:31,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:31,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:31,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2023-11-06 23:01:31,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:33,856 INFO L124 PetriNetUnfolderBase]: 10795/15110 cut-off events. [2023-11-06 23:01:33,856 INFO L125 PetriNetUnfolderBase]: For 18733/19209 co-relation queries the response was YES. [2023-11-06 23:01:33,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47584 conditions, 15110 events. 10795/15110 cut-off events. For 18733/19209 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 80779 event pairs, 4422 based on Foata normal form. 442/14928 useless extension candidates. Maximal degree in co-relation 47566. Up to 11257 conditions per place. [2023-11-06 23:01:33,983 INFO L140 encePairwiseOnDemand]: 236/245 looper letters, 61 selfloop transitions, 18 changer transitions 21/110 dead transitions. [2023-11-06 23:01:33,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 110 transitions, 677 flow [2023-11-06 23:01:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:01:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:01:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 977 transitions. [2023-11-06 23:01:33,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498469387755102 [2023-11-06 23:01:33,989 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 977 transitions. [2023-11-06 23:01:33,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 977 transitions. [2023-11-06 23:01:33,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:33,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 977 transitions. [2023-11-06 23:01:33,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:33,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:33,998 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:33,999 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 202 flow. Second operand 8 states and 977 transitions. [2023-11-06 23:01:33,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 110 transitions, 677 flow [2023-11-06 23:01:34,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 652 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 23:01:34,168 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 360 flow [2023-11-06 23:01:34,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=360, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2023-11-06 23:01:34,169 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-11-06 23:01:34,169 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 360 flow [2023-11-06 23:01:34,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:34,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:34,170 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-06 23:01:34,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:01:34,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:34,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:34,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1771882641, now seen corresponding path program 1 times [2023-11-06 23:01:34,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:34,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647763525] [2023-11-06 23:01:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:34,650 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-06 23:01:34,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647763525] [2023-11-06 23:01:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647763525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:34,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:34,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818379890] [2023-11-06 23:01:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:34,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:34,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:34,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:34,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:34,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2023-11-06 23:01:34,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:34,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:34,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2023-11-06 23:01:34,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:37,162 INFO L124 PetriNetUnfolderBase]: 10893/15197 cut-off events. [2023-11-06 23:01:37,163 INFO L125 PetriNetUnfolderBase]: For 38702/40011 co-relation queries the response was YES. [2023-11-06 23:01:37,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55547 conditions, 15197 events. 10893/15197 cut-off events. For 38702/40011 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 82136 event pairs, 3443 based on Foata normal form. 322/14870 useless extension candidates. Maximal degree in co-relation 55524. Up to 10062 conditions per place. [2023-11-06 23:01:37,310 INFO L140 encePairwiseOnDemand]: 236/245 looper letters, 70 selfloop transitions, 16 changer transitions 16/112 dead transitions. [2023-11-06 23:01:37,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 112 transitions, 830 flow [2023-11-06 23:01:37,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:01:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:01:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-11-06 23:01:37,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501360544217687 [2023-11-06 23:01:37,324 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-11-06 23:01:37,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-11-06 23:01:37,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:37,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-11-06 23:01:37,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:37,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:37,341 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:37,341 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 360 flow. Second operand 6 states and 737 transitions. [2023-11-06 23:01:37,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 112 transitions, 830 flow [2023-11-06 23:01:38,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 112 transitions, 802 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-06 23:01:38,135 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 472 flow [2023-11-06 23:01:38,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2023-11-06 23:01:38,136 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2023-11-06 23:01:38,136 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 472 flow [2023-11-06 23:01:38,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:38,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:38,137 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-06 23:01:38,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:01:38,138 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:38,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1378057361, now seen corresponding path program 2 times [2023-11-06 23:01:38,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:38,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440762932] [2023-11-06 23:01:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:38,578 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-06 23:01:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440762932] [2023-11-06 23:01:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440762932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:38,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:38,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:38,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865786706] [2023-11-06 23:01:38,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:38,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:38,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:38,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:38,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:38,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-11-06 23:01:38,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 472 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:38,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:38,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-11-06 23:01:38,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:40,608 INFO L124 PetriNetUnfolderBase]: 10977/15305 cut-off events. [2023-11-06 23:01:40,608 INFO L125 PetriNetUnfolderBase]: For 46794/48087 co-relation queries the response was YES. [2023-11-06 23:01:40,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59855 conditions, 15305 events. 10977/15305 cut-off events. For 46794/48087 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 81896 event pairs, 3938 based on Foata normal form. 334/14996 useless extension candidates. Maximal degree in co-relation 59830. Up to 10090 conditions per place. [2023-11-06 23:01:40,749 INFO L140 encePairwiseOnDemand]: 237/245 looper letters, 72 selfloop transitions, 18 changer transitions 22/122 dead transitions. [2023-11-06 23:01:40,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 122 transitions, 1006 flow [2023-11-06 23:01:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:01:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:01:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-11-06 23:01:40,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2023-11-06 23:01:40,755 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-11-06 23:01:40,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-11-06 23:01:40,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:40,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-11-06 23:01:40,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:40,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:40,764 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:40,765 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 472 flow. Second operand 7 states and 882 transitions. [2023-11-06 23:01:40,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 122 transitions, 1006 flow [2023-11-06 23:01:41,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 969 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-06 23:01:41,190 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 553 flow [2023-11-06 23:01:41,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=553, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2023-11-06 23:01:41,192 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2023-11-06 23:01:41,192 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 553 flow [2023-11-06 23:01:41,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:41,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:41,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:41,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:01:41,193 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:41,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1722356411, now seen corresponding path program 1 times [2023-11-06 23:01:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:41,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026301236] [2023-11-06 23:01:41,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:41,744 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-06 23:01:41,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:41,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026301236] [2023-11-06 23:01:41,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026301236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:41,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176173610] [2023-11-06 23:01:41,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:41,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:41,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:41,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-11-06 23:01:41,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:41,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:41,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-11-06 23:01:41,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:43,690 INFO L124 PetriNetUnfolderBase]: 10682/14890 cut-off events. [2023-11-06 23:01:43,691 INFO L125 PetriNetUnfolderBase]: For 70125/71418 co-relation queries the response was YES. [2023-11-06 23:01:43,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63095 conditions, 14890 events. 10682/14890 cut-off events. For 70125/71418 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 79448 event pairs, 3548 based on Foata normal form. 302/14543 useless extension candidates. Maximal degree in co-relation 63067. Up to 10004 conditions per place. [2023-11-06 23:01:43,834 INFO L140 encePairwiseOnDemand]: 236/245 looper letters, 71 selfloop transitions, 17 changer transitions 16/114 dead transitions. [2023-11-06 23:01:43,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 114 transitions, 996 flow [2023-11-06 23:01:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:01:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:01:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2023-11-06 23:01:43,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163265306122449 [2023-11-06 23:01:43,839 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2023-11-06 23:01:43,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2023-11-06 23:01:43,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:43,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2023-11-06 23:01:43,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:43,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:43,848 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:43,849 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 553 flow. Second operand 6 states and 759 transitions. [2023-11-06 23:01:43,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 114 transitions, 996 flow [2023-11-06 23:01:44,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 114 transitions, 944 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-11-06 23:01:44,647 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 577 flow [2023-11-06 23:01:44,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=577, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-11-06 23:01:44,648 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2023-11-06 23:01:44,648 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 577 flow [2023-11-06 23:01:44,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:44,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:44,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:44,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:01:44,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:44,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash 925530568, now seen corresponding path program 1 times [2023-11-06 23:01:44,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:44,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009149936] [2023-11-06 23:01:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:44,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:45,402 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-06 23:01:45,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009149936] [2023-11-06 23:01:45,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009149936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:45,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:45,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:01:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321476333] [2023-11-06 23:01:45,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:45,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:01:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:45,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:01:45,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:01:45,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 245 [2023-11-06 23:01:45,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 577 flow. Second operand has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:45,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:45,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 245 [2023-11-06 23:01:45,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:47,664 INFO L124 PetriNetUnfolderBase]: 11077/15441 cut-off events. [2023-11-06 23:01:47,664 INFO L125 PetriNetUnfolderBase]: For 64875/66137 co-relation queries the response was YES. [2023-11-06 23:01:47,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63888 conditions, 15441 events. 11077/15441 cut-off events. For 64875/66137 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 82762 event pairs, 3729 based on Foata normal form. 298/15190 useless extension candidates. Maximal degree in co-relation 63859. Up to 10093 conditions per place. [2023-11-06 23:01:47,774 INFO L140 encePairwiseOnDemand]: 235/245 looper letters, 80 selfloop transitions, 22 changer transitions 15/127 dead transitions. [2023-11-06 23:01:47,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 127 transitions, 1087 flow [2023-11-06 23:01:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:01:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:01:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2023-11-06 23:01:47,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49620991253644314 [2023-11-06 23:01:47,779 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2023-11-06 23:01:47,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2023-11-06 23:01:47,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:47,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2023-11-06 23:01:47,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:47,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:47,788 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:47,788 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 577 flow. Second operand 7 states and 851 transitions. [2023-11-06 23:01:47,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 127 transitions, 1087 flow [2023-11-06 23:01:48,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 127 transitions, 1049 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-06 23:01:48,113 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 660 flow [2023-11-06 23:01:48,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=660, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2023-11-06 23:01:48,114 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2023-11-06 23:01:48,114 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 660 flow [2023-11-06 23:01:48,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:48,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:48,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:48,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:01:48,116 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:48,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1405010272, now seen corresponding path program 2 times [2023-11-06 23:01:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310091561] [2023-11-06 23:01:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:48,709 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-06 23:01:48,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:48,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310091561] [2023-11-06 23:01:48,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310091561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:48,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:48,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:01:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741558054] [2023-11-06 23:01:48,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:48,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:01:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:48,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:01:48,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:01:48,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2023-11-06 23:01:48,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 660 flow. Second operand has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:48,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:48,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2023-11-06 23:01:48,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:51,787 INFO L124 PetriNetUnfolderBase]: 12925/18104 cut-off events. [2023-11-06 23:01:51,788 INFO L125 PetriNetUnfolderBase]: For 112593/114548 co-relation queries the response was YES. [2023-11-06 23:01:51,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84644 conditions, 18104 events. 12925/18104 cut-off events. For 112593/114548 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 101572 event pairs, 3675 based on Foata normal form. 842/18249 useless extension candidates. Maximal degree in co-relation 84614. Up to 9573 conditions per place. [2023-11-06 23:01:51,959 INFO L140 encePairwiseOnDemand]: 236/245 looper letters, 81 selfloop transitions, 32 changer transitions 20/143 dead transitions. [2023-11-06 23:01:51,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 143 transitions, 1342 flow [2023-11-06 23:01:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:01:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:01:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2023-11-06 23:01:51,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084548104956268 [2023-11-06 23:01:51,967 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2023-11-06 23:01:51,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2023-11-06 23:01:51,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:51,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2023-11-06 23:01:51,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:51,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:51,977 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:51,977 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 660 flow. Second operand 7 states and 872 transitions. [2023-11-06 23:01:51,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 143 transitions, 1342 flow [2023-11-06 23:01:52,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 143 transitions, 1281 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-06 23:01:52,406 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 770 flow [2023-11-06 23:01:52,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=770, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2023-11-06 23:01:52,406 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2023-11-06 23:01:52,406 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 770 flow [2023-11-06 23:01:52,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:52,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:52,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:52,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:01:52,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:52,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash 196997857, now seen corresponding path program 1 times [2023-11-06 23:01:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159760881] [2023-11-06 23:01:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:52,685 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-06 23:01:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159760881] [2023-11-06 23:01:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159760881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:52,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:52,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825693124] [2023-11-06 23:01:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:52,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:01:52,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:01:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:52,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245 [2023-11-06 23:01:52,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 770 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:52,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:52,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245 [2023-11-06 23:01:52,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:54,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 276#true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 106#L876true, P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), P0Thread1of1ForFork1InUse, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 288#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 282#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 71#P2EXITtrue, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 97#L834true, 197#true, 295#(= ~y~0 1), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 123#L765true, 13#L785true]) [2023-11-06 23:01:54,906 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:01:54,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:54,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:54,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:55,753 INFO L124 PetriNetUnfolderBase]: 17172/24320 cut-off events. [2023-11-06 23:01:55,753 INFO L125 PetriNetUnfolderBase]: For 180871/182466 co-relation queries the response was YES. [2023-11-06 23:01:56,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121180 conditions, 24320 events. 17172/24320 cut-off events. For 180871/182466 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 146564 event pairs, 3709 based on Foata normal form. 749/24701 useless extension candidates. Maximal degree in co-relation 121148. Up to 12626 conditions per place. [2023-11-06 23:01:56,225 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 122 selfloop transitions, 2 changer transitions 32/168 dead transitions. [2023-11-06 23:01:56,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 168 transitions, 1941 flow [2023-11-06 23:01:56,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:01:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 625 transitions. [2023-11-06 23:01:56,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2023-11-06 23:01:56,229 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 625 transitions. [2023-11-06 23:01:56,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 625 transitions. [2023-11-06 23:01:56,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:56,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 625 transitions. [2023-11-06 23:01:56,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:56,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:56,236 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:56,236 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 770 flow. Second operand 5 states and 625 transitions. [2023-11-06 23:01:56,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 168 transitions, 1941 flow [2023-11-06 23:01:57,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 168 transitions, 1788 flow, removed 46 selfloop flow, removed 4 redundant places. [2023-11-06 23:01:57,551 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 730 flow [2023-11-06 23:01:57,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=730, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2023-11-06 23:01:57,552 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-11-06 23:01:57,552 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 730 flow [2023-11-06 23:01:57,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:57,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:57,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:57,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:01:57,553 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:01:57,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:57,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1025211259, now seen corresponding path program 2 times [2023-11-06 23:01:57,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:57,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917662439] [2023-11-06 23:01:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:57,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:57,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-06 23:01:57,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:57,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917662439] [2023-11-06 23:01:57,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917662439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:57,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:57,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:57,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459645744] [2023-11-06 23:01:57,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:57,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:57,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:57,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:57,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:57,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-11-06 23:01:57,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 730 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:57,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:57,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-11-06 23:01:57,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:59,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][130], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 123#L765true, 93#L795true]) [2023-11-06 23:01:59,264 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:01:59,265 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:01:59,265 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:01:59,265 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:01:59,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][131], [Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 21#L865-3true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 307#true]) [2023-11-06 23:01:59,491 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,492 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,492 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,492 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][130], [60#L869true, 113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 123#L765true, 93#L795true]) [2023-11-06 23:01:59,497 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,497 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,497 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,497 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][120], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 123#L765true, 93#L795true]) [2023-11-06 23:01:59,498 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,498 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,498 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,498 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][144], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 93#L795true]) [2023-11-06 23:01:59,501 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,501 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,501 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,501 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][144], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 123#L765true]) [2023-11-06 23:01:59,502 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,502 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,502 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:01:59,502 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:00,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][131], [113#L811true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 21#L865-3true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 307#true]) [2023-11-06 23:02:00,032 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,033 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,033 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,033 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), P2Thread1of1ForFork0InUse, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 21#L865-3true, 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 307#true]) [2023-11-06 23:02:00,033 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,033 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,033 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,034 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][131], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), P2Thread1of1ForFork0InUse, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 307#true]) [2023-11-06 23:02:00,040 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,040 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,040 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,040 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L869-->L876: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_90 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_193 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_90 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_194 256) 0)) .cse5)) (.cse1 (and .cse5 .cse3)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_165 256) 0))))) (and (= v_~x$w_buff0_used~0_193 (ite .cse0 0 v_~x$w_buff0_used~0_194)) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_90) v_~x$r_buff0_thd0~0_89) (= v_~x~0_117 (ite .cse0 v_~x$w_buff0~0_106 (ite .cse2 v_~x$w_buff1~0_85 v_~x~0_118))) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| 0)) (= v_~x$r_buff1_thd0~0_89 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_89 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_164 256) 0)))) 0 v_~x$r_buff1_thd0~0_90)) (= v_~x$w_buff1_used~0_164 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_165))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_106, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_165, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_90, ~x~0=v_~x~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_194, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_106, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_89, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_89, ~x~0=v_~x~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_193} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][102], [Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, 106#L876true, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 97#L834true, 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 307#true]) [2023-11-06 23:02:00,040 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,040 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,040 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,040 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][144], [60#L869true, 113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), P2Thread1of1ForFork0InUse, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 93#L795true]) [2023-11-06 23:02:00,045 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,045 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,045 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,045 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][143], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 93#L795true]) [2023-11-06 23:02:00,046 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,046 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,046 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,046 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][144], [60#L869true, 113#L811true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 123#L765true, 31#L841true]) [2023-11-06 23:02:00,048 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,048 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,048 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,048 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][143], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 123#L765true]) [2023-11-06 23:02:00,049 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,049 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,050 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,050 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][144], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true]) [2023-11-06 23:02:00,052 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,052 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,052 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,052 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:00,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][131], [60#L869true, 113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 307#true]) [2023-11-06 23:02:00,210 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,211 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,211 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,211 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][87], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 307#true]) [2023-11-06 23:02:00,211 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,211 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,211 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,212 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L869-->L876: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_90 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_193 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_90 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_194 256) 0)) .cse5)) (.cse1 (and .cse5 .cse3)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_165 256) 0))))) (and (= v_~x$w_buff0_used~0_193 (ite .cse0 0 v_~x$w_buff0_used~0_194)) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_90) v_~x$r_buff0_thd0~0_89) (= v_~x~0_117 (ite .cse0 v_~x$w_buff0~0_106 (ite .cse2 v_~x$w_buff1~0_85 v_~x~0_118))) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| 0)) (= v_~x$r_buff1_thd0~0_89 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_89 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_164 256) 0)))) 0 v_~x$r_buff1_thd0~0_90)) (= v_~x$w_buff1_used~0_164 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_165))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_106, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_165, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_90, ~x~0=v_~x~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_194, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_106, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_89, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_89, ~x~0=v_~x~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_193} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][102], [113#L811true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 106#L876true, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), P2Thread1of1ForFork0InUse, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 307#true]) [2023-11-06 23:02:00,213 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,213 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,213 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,213 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][144], [60#L869true, 113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true]) [2023-11-06 23:02:00,224 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,224 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,224 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,224 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][143], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 302#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 115#P1EXITtrue, 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1))]) [2023-11-06 23:02:00,225 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,225 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,225 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,225 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:00,516 INFO L124 PetriNetUnfolderBase]: 12730/18665 cut-off events. [2023-11-06 23:02:00,516 INFO L125 PetriNetUnfolderBase]: For 163634/168426 co-relation queries the response was YES. [2023-11-06 23:02:00,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89265 conditions, 18665 events. 12730/18665 cut-off events. For 163634/168426 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 120913 event pairs, 2946 based on Foata normal form. 2545/20212 useless extension candidates. Maximal degree in co-relation 89233. Up to 10411 conditions per place. [2023-11-06 23:02:00,651 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 169 selfloop transitions, 10 changer transitions 6/200 dead transitions. [2023-11-06 23:02:00,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 200 transitions, 2227 flow [2023-11-06 23:02:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:02:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:02:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2023-11-06 23:02:00,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216326530612245 [2023-11-06 23:02:00,655 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2023-11-06 23:02:00,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2023-11-06 23:02:00,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:00,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2023-11-06 23:02:00,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:00,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:00,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:00,662 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 730 flow. Second operand 5 states and 639 transitions. [2023-11-06 23:02:00,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 200 transitions, 2227 flow [2023-11-06 23:02:00,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 200 transitions, 2221 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:02:00,816 INFO L231 Difference]: Finished difference. Result has 78 places, 91 transitions, 818 flow [2023-11-06 23:02:00,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=818, PETRI_PLACES=78, PETRI_TRANSITIONS=91} [2023-11-06 23:02:00,817 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2023-11-06 23:02:00,817 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 91 transitions, 818 flow [2023-11-06 23:02:00,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:00,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:00,818 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-06 23:02:00,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:02:00,819 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:02:00,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash 922847831, now seen corresponding path program 1 times [2023-11-06 23:02:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:00,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366468619] [2023-11-06 23:02:00,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:00,997 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-06 23:02:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:00,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366468619] [2023-11-06 23:02:00,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366468619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:00,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:00,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:02:00,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459450857] [2023-11-06 23:02:00,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:00,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:02:00,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:00,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:02:00,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:02:01,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-11-06 23:02:01,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 91 transitions, 818 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:01,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:01,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-11-06 23:02:01,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:02,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][133], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), 323#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), P2Thread1of1ForFork0InUse, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 123#L765true, 31#L841true, Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), 93#L795true]) [2023-11-06 23:02:02,856 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:02:02,856 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:02,856 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:02,856 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:03,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][200], [Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 317#true, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 21#L865-3true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,026 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,026 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,026 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,026 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][133], [60#L869true, 113#L811true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), 323#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 123#L765true, 31#L841true, Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), 93#L795true]) [2023-11-06 23:02:03,030 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,030 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,030 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,030 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][121], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), 323#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 123#L765true, Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), 93#L795true]) [2023-11-06 23:02:03,031 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,031 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,031 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,031 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][147], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 325#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 309#(= ~__unbuffered_cnt~0 0), 93#L795true, Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-06 23:02:03,034 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,034 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,034 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,034 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][147], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 325#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 123#L765true, 31#L841true, Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-06 23:02:03,035 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,035 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,036 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,036 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:03,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][200], [113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), P2Thread1of1ForFork0InUse, 317#true, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 21#L865-3true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,171 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,171 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,171 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,171 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][150], [Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 317#true, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 21#L865-3true, 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,172 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,172 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,172 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,172 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][200], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 317#true, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,176 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,176 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,176 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,176 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L869-->L876: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_90 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_193 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_90 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_194 256) 0)) .cse5)) (.cse1 (and .cse5 .cse3)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_165 256) 0))))) (and (= v_~x$w_buff0_used~0_193 (ite .cse0 0 v_~x$w_buff0_used~0_194)) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_90) v_~x$r_buff0_thd0~0_89) (= v_~x~0_117 (ite .cse0 v_~x$w_buff0~0_106 (ite .cse2 v_~x$w_buff1~0_85 v_~x~0_118))) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| 0)) (= v_~x$r_buff1_thd0~0_89 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_89 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_164 256) 0)))) 0 v_~x$r_buff1_thd0~0_90)) (= v_~x$w_buff1_used~0_164 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_165))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_106, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_165, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_90, ~x~0=v_~x~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_194, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_106, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_89, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_89, ~x~0=v_~x~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_193} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][179], [Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, 106#L876true, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 317#true, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,177 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,177 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,177 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,177 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][210], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 321#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,178 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,178 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,178 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,178 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][147], [60#L869true, 113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 325#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 309#(= ~__unbuffered_cnt~0 0), 93#L795true, Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-06 23:02:03,181 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,181 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,181 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,181 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][146], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 325#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 309#(= ~__unbuffered_cnt~0 0), 93#L795true, Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-06 23:02:03,182 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,182 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,182 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,182 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][147], [60#L869true, 113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), P2Thread1of1ForFork0InUse, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 325#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, 123#L765true, Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-06 23:02:03,185 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,186 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,186 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,186 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][146], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 325#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 123#L765true, Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-06 23:02:03,186 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,186 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,186 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,188 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,190 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][210], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 321#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 105#L808true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-06 23:02:03,190 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,190 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,190 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,190 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:03,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][200], [60#L869true, 113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 317#true, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,297 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,298 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,298 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,298 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L869-->L876: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_90 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_193 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_90 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_194 256) 0)) .cse5)) (.cse1 (and .cse5 .cse3)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_165 256) 0))))) (and (= v_~x$w_buff0_used~0_193 (ite .cse0 0 v_~x$w_buff0_used~0_194)) (= (ite .cse1 0 v_~x$r_buff0_thd0~0_90) v_~x$r_buff0_thd0~0_89) (= v_~x~0_117 (ite .cse0 v_~x$w_buff0~0_106 (ite .cse2 v_~x$w_buff1~0_85 v_~x~0_118))) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| 0)) (= v_~x$r_buff1_thd0~0_89 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_89 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_164 256) 0)))) 0 v_~x$r_buff1_thd0~0_90)) (= v_~x$w_buff1_used~0_164 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_165))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_106, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_165, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_90, ~x~0=v_~x~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_194, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_106, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_89, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_89, ~x~0=v_~x~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_193} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][179], [113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, 106#L876true, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 317#true, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,298 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,298 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,298 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,298 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][150], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 317#true, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,299 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,299 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,299 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,299 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][210], [60#L869true, 113#L811true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 321#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,300 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,300 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,300 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,300 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][198], [60#L869true, Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 321#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 295#(= ~y~0 1), 197#true, Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 307#true]) [2023-11-06 23:02:03,301 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,301 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,301 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,301 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][210], [60#L869true, 113#L811true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 321#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), P2Thread1of1ForFork0InUse, Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 31#L841true, Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-06 23:02:03,306 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,306 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,306 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,306 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][198], [60#L869true, Black: 189#(or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))), Black: 253#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1))), Black: 192#(and (or (and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 109#P0EXITtrue, 321#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork0InUse, Black: 266#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 201#(and (<= 0 (div ~x$r_buff0_thd0~0 256)) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 206#(and (= ~x~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)) (= 0 ~x$r_buff0_thd0~0)), 45#L818true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 280#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 227#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 97#L834true, Black: 166#(= ~__unbuffered_p2_EAX~0 0), 197#true, 295#(= ~y~0 1), Black: 299#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 115#P1EXITtrue, 310#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0)), Black: 237#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 309#(= ~__unbuffered_cnt~0 0), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-06 23:02:03,306 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,306 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,307 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,307 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:03,517 INFO L124 PetriNetUnfolderBase]: 9672/14623 cut-off events. [2023-11-06 23:02:03,517 INFO L125 PetriNetUnfolderBase]: For 147619/152825 co-relation queries the response was YES. [2023-11-06 23:02:03,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77912 conditions, 14623 events. 9672/14623 cut-off events. For 147619/152825 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 97642 event pairs, 1376 based on Foata normal form. 2018/15881 useless extension candidates. Maximal degree in co-relation 77877. Up to 5888 conditions per place. [2023-11-06 23:02:03,626 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 194 selfloop transitions, 19 changer transitions 18/246 dead transitions. [2023-11-06 23:02:03,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 246 transitions, 2822 flow [2023-11-06 23:02:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:02:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:02:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2023-11-06 23:02:03,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2023-11-06 23:02:03,630 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2023-11-06 23:02:03,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2023-11-06 23:02:03,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:03,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2023-11-06 23:02:03,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:03,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:03,638 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:03,638 INFO L175 Difference]: Start difference. First operand has 78 places, 91 transitions, 818 flow. Second operand 7 states and 896 transitions. [2023-11-06 23:02:03,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 246 transitions, 2822 flow [2023-11-06 23:02:03,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 246 transitions, 2817 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:02:03,848 INFO L231 Difference]: Finished difference. Result has 86 places, 96 transitions, 914 flow [2023-11-06 23:02:03,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=914, PETRI_PLACES=86, PETRI_TRANSITIONS=96} [2023-11-06 23:02:03,849 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2023-11-06 23:02:03,849 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 96 transitions, 914 flow [2023-11-06 23:02:03,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:03,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:03,850 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-06 23:02:03,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:02:03,850 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:02:03,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:03,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1769565705, now seen corresponding path program 1 times [2023-11-06 23:02:03,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:03,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187877122] [2023-11-06 23:02:03,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:04,574 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-06 23:02:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:04,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187877122] [2023-11-06 23:02:04,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187877122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:04,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:04,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:02:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975164661] [2023-11-06 23:02:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:04,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:02:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:02:04,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:02:04,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2023-11-06 23:02:04,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 96 transitions, 914 flow. Second operand has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:04,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:04,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2023-11-06 23:02:04,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:09,330 INFO L124 PetriNetUnfolderBase]: 18417/27044 cut-off events. [2023-11-06 23:02:09,330 INFO L125 PetriNetUnfolderBase]: For 174088/174583 co-relation queries the response was YES. [2023-11-06 23:02:09,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149490 conditions, 27044 events. 18417/27044 cut-off events. For 174088/174583 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 174640 event pairs, 498 based on Foata normal form. 532/27569 useless extension candidates. Maximal degree in co-relation 149451. Up to 12140 conditions per place. [2023-11-06 23:02:09,531 INFO L140 encePairwiseOnDemand]: 232/245 looper letters, 169 selfloop transitions, 84 changer transitions 96/353 dead transitions. [2023-11-06 23:02:09,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 353 transitions, 3926 flow [2023-11-06 23:02:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:02:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 23:02:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1128 transitions. [2023-11-06 23:02:09,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46040816326530615 [2023-11-06 23:02:09,537 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1128 transitions. [2023-11-06 23:02:09,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1128 transitions. [2023-11-06 23:02:09,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:09,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1128 transitions. [2023-11-06 23:02:09,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.8) internal successors, (1128), 10 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:09,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:09,549 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:09,549 INFO L175 Difference]: Start difference. First operand has 86 places, 96 transitions, 914 flow. Second operand 10 states and 1128 transitions. [2023-11-06 23:02:09,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 353 transitions, 3926 flow [2023-11-06 23:02:13,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 353 transitions, 3687 flow, removed 82 selfloop flow, removed 3 redundant places. [2023-11-06 23:02:13,424 INFO L231 Difference]: Finished difference. Result has 100 places, 146 transitions, 1733 flow [2023-11-06 23:02:13,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1733, PETRI_PLACES=100, PETRI_TRANSITIONS=146} [2023-11-06 23:02:13,428 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2023-11-06 23:02:13,428 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 146 transitions, 1733 flow [2023-11-06 23:02:13,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:13,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:13,444 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-06 23:02:13,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:02:13,444 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:02:13,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2033690813, now seen corresponding path program 2 times [2023-11-06 23:02:13,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812436242] [2023-11-06 23:02:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:13,690 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-06 23:02:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812436242] [2023-11-06 23:02:13,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812436242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:13,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:02:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248615386] [2023-11-06 23:02:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:13,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:02:13,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:13,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:02:13,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:02:14,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-11-06 23:02:14,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 146 transitions, 1733 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:14,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:14,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-11-06 23:02:14,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:16,585 INFO L124 PetriNetUnfolderBase]: 9446/14572 cut-off events. [2023-11-06 23:02:16,585 INFO L125 PetriNetUnfolderBase]: For 202210/206019 co-relation queries the response was YES. [2023-11-06 23:02:16,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86832 conditions, 14572 events. 9446/14572 cut-off events. For 202210/206019 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 101252 event pairs, 1104 based on Foata normal form. 1854/15874 useless extension candidates. Maximal degree in co-relation 86785. Up to 6074 conditions per place. [2023-11-06 23:02:16,700 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 311 selfloop transitions, 23 changer transitions 43/400 dead transitions. [2023-11-06 23:02:16,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 400 transitions, 5706 flow [2023-11-06 23:02:16,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:02:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:02:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1146 transitions. [2023-11-06 23:02:16,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197278911564626 [2023-11-06 23:02:16,705 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1146 transitions. [2023-11-06 23:02:16,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1146 transitions. [2023-11-06 23:02:16,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:16,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1146 transitions. [2023-11-06 23:02:16,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.33333333333333) internal successors, (1146), 9 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:16,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:16,715 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:16,715 INFO L175 Difference]: Start difference. First operand has 100 places, 146 transitions, 1733 flow. Second operand 9 states and 1146 transitions. [2023-11-06 23:02:16,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 400 transitions, 5706 flow [2023-11-06 23:02:17,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 400 transitions, 5347 flow, removed 91 selfloop flow, removed 5 redundant places. [2023-11-06 23:02:17,502 INFO L231 Difference]: Finished difference. Result has 104 places, 144 transitions, 1634 flow [2023-11-06 23:02:17,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1634, PETRI_PLACES=104, PETRI_TRANSITIONS=144} [2023-11-06 23:02:17,502 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places. [2023-11-06 23:02:17,502 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 144 transitions, 1634 flow [2023-11-06 23:02:17,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:17,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:17,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:02:17,503 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:02:17,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1763317126, now seen corresponding path program 1 times [2023-11-06 23:02:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:17,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634607926] [2023-11-06 23:02:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:17,818 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-06 23:02:17,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:17,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634607926] [2023-11-06 23:02:17,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634607926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:17,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:17,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:02:17,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823941874] [2023-11-06 23:02:17,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:17,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:02:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:17,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:02:17,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:02:17,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-11-06 23:02:17,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 144 transitions, 1634 flow. Second operand has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:17,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:17,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-11-06 23:02:17,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:20,965 INFO L124 PetriNetUnfolderBase]: 9325/14332 cut-off events. [2023-11-06 23:02:20,965 INFO L125 PetriNetUnfolderBase]: For 158384/161551 co-relation queries the response was YES. [2023-11-06 23:02:21,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86243 conditions, 14332 events. 9325/14332 cut-off events. For 158384/161551 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 99230 event pairs, 1164 based on Foata normal form. 1084/14896 useless extension candidates. Maximal degree in co-relation 86195. Up to 6039 conditions per place. [2023-11-06 23:02:21,069 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 171 selfloop transitions, 28 changer transitions 185/398 dead transitions. [2023-11-06 23:02:21,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 398 transitions, 5407 flow [2023-11-06 23:02:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:02:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 23:02:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1375 transitions. [2023-11-06 23:02:21,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2023-11-06 23:02:21,075 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1375 transitions. [2023-11-06 23:02:21,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1375 transitions. [2023-11-06 23:02:21,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:21,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1375 transitions. [2023-11-06 23:02:21,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:21,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 245.0) internal successors, (2940), 12 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:21,086 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 245.0) internal successors, (2940), 12 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:21,086 INFO L175 Difference]: Start difference. First operand has 104 places, 144 transitions, 1634 flow. Second operand 11 states and 1375 transitions. [2023-11-06 23:02:21,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 398 transitions, 5407 flow [2023-11-06 23:02:22,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 398 transitions, 4988 flow, removed 47 selfloop flow, removed 8 redundant places. [2023-11-06 23:02:22,732 INFO L231 Difference]: Finished difference. Result has 109 places, 101 transitions, 1015 flow [2023-11-06 23:02:22,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1015, PETRI_PLACES=109, PETRI_TRANSITIONS=101} [2023-11-06 23:02:22,733 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 64 predicate places. [2023-11-06 23:02:22,733 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 101 transitions, 1015 flow [2023-11-06 23:02:22,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:22,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:22,733 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] [2023-11-06 23:02:22,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:02:22,734 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:02:22,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:22,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1608551360, now seen corresponding path program 1 times [2023-11-06 23:02:22,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:22,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430383758] [2023-11-06 23:02:22,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:22,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:22,984 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-06 23:02:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430383758] [2023-11-06 23:02:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430383758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:22,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:02:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195142680] [2023-11-06 23:02:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:22,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:02:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:02:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:02:23,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245 [2023-11-06 23:02:23,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 101 transitions, 1015 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:23,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:23,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245 [2023-11-06 23:02:23,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:24,500 INFO L124 PetriNetUnfolderBase]: 6097/10039 cut-off events. [2023-11-06 23:02:24,500 INFO L125 PetriNetUnfolderBase]: For 73204/74208 co-relation queries the response was YES. [2023-11-06 23:02:24,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56872 conditions, 10039 events. 6097/10039 cut-off events. For 73204/74208 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 69594 event pairs, 1471 based on Foata normal form. 70/9791 useless extension candidates. Maximal degree in co-relation 56826. Up to 4968 conditions per place. [2023-11-06 23:02:24,573 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 92 selfloop transitions, 1 changer transitions 108/208 dead transitions. [2023-11-06 23:02:24,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 208 transitions, 2511 flow [2023-11-06 23:02:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:02:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:02:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-11-06 23:02:24,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2023-11-06 23:02:24,575 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-11-06 23:02:24,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-11-06 23:02:24,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:24,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-11-06 23:02:24,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:24,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:24,579 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:24,579 INFO L175 Difference]: Start difference. First operand has 109 places, 101 transitions, 1015 flow. Second operand 5 states and 616 transitions. [2023-11-06 23:02:24,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 208 transitions, 2511 flow [2023-11-06 23:02:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 208 transitions, 2126 flow, removed 120 selfloop flow, removed 13 redundant places. [2023-11-06 23:02:25,129 INFO L231 Difference]: Finished difference. Result has 101 places, 64 transitions, 470 flow [2023-11-06 23:02:25,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=470, PETRI_PLACES=101, PETRI_TRANSITIONS=64} [2023-11-06 23:02:25,130 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 56 predicate places. [2023-11-06 23:02:25,130 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 64 transitions, 470 flow [2023-11-06 23:02:25,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:25,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:25,131 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] [2023-11-06 23:02:25,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:02:25,132 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:02:25,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1343234118, now seen corresponding path program 2 times [2023-11-06 23:02:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675008156] [2023-11-06 23:02:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:02:25,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:02:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:02:25,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:02:25,338 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:02:25,339 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-06 23:02:25,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-06 23:02:25,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-06 23:02:25,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-06 23:02:25,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-06 23:02:25,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-06 23:02:25,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-06 23:02:25,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:02:25,349 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:25,356 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:02:25,356 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:02:25,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:02:25 BasicIcfg [2023-11-06 23:02:25,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:02:25,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:02:25,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:02:25,496 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:02:25,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:11" (3/4) ... [2023-11-06 23:02:25,498 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 23:02:25,622 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:02:25,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:02:25,623 INFO L158 Benchmark]: Toolchain (without parser) took 75811.66ms. Allocated memory was 111.1MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 67.7MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-06 23:02:25,623 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 111.1MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:02:25,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 856.41ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 67.5MB in the beginning and 111.4MB in the end (delta: -43.9MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2023-11-06 23:02:25,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.43ms. Allocated memory is still 140.5MB. Free memory was 111.4MB in the beginning and 108.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:02:25,624 INFO L158 Benchmark]: Boogie Preprocessor took 87.70ms. Allocated memory is still 140.5MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:02:25,625 INFO L158 Benchmark]: RCFGBuilder took 933.14ms. Allocated memory is still 140.5MB. Free memory was 106.7MB in the beginning and 65.4MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-11-06 23:02:25,625 INFO L158 Benchmark]: TraceAbstraction took 73681.04ms. Allocated memory was 140.5MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 64.8MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-06 23:02:25,625 INFO L158 Benchmark]: Witness Printer took 126.04ms. Allocated memory is still 5.7GB. Free memory was 4.6GB in the beginning and 4.6GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 23:02:25,629 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.34ms. Allocated memory is still 111.1MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 856.41ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 67.5MB in the beginning and 111.4MB in the end (delta: -43.9MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.43ms. Allocated memory is still 140.5MB. Free memory was 111.4MB in the beginning and 108.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.70ms. Allocated memory is still 140.5MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 933.14ms. Allocated memory is still 140.5MB. Free memory was 106.7MB in the beginning and 65.4MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 73681.04ms. Allocated memory was 140.5MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 64.8MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 126.04ms. Allocated memory is still 5.7GB. Free memory was 4.6GB in the beginning and 4.6GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 143 PlacesBefore, 45 PlacesAfterwards, 132 TransitionsBefore, 33 TransitionsAfterwards, 3520 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 10140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4765, independent: 4506, independent conditional: 0, independent unconditional: 4506, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1820, independent: 1778, independent conditional: 0, independent unconditional: 1778, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4765, independent: 2728, independent conditional: 0, independent unconditional: 2728, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 1820, unknown conditional: 0, unknown unconditional: 1820] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-2, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=-1, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t147; [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=0, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t148; [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=1, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 865]: 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: 863]: 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: 859]: 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 9 procedures, 174 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 73.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 56.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1295 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1110 mSDsluCounter, 683 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 544 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3415 IncrementalHoareTripleChecker+Invalid, 3629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 139 mSDtfsCounter, 3415 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1733occurred in iteration=15, InterpolantAutomatonStates: 117, 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.6s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 2919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 proved your program to be incorrect! [2023-11-06 23:02:25,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1bc2f59-835a-4377-9b49-c647e9af26e8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE