./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix013.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:42:38,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:42:38,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:42:38,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:42:38,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:42:38,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:42:38,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:42:38,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:42:38,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:42:38,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:42:38,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:42:38,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:42:38,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:42:38,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:42:38,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:42:38,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:38,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:38,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:42:38,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:42:38,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:42:38,969 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2025-01-10 00:42:39,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:42:39,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:42:39,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:42:39,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:42:39,226 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:42:39,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2025-01-10 00:42:40,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8b9c716e/f70818c09e0841e590d0aa3691505af0/FLAGa2d7fce9c [2025-01-10 00:42:40,882 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:42:40,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2025-01-10 00:42:40,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8b9c716e/f70818c09e0841e590d0aa3691505af0/FLAGa2d7fce9c [2025-01-10 00:42:40,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8b9c716e/f70818c09e0841e590d0aa3691505af0 [2025-01-10 00:42:40,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:42:40,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:42:40,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:42:40,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:42:40,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:42:40,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:42:40" (1/1) ... [2025-01-10 00:42:40,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c17005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:40, skipping insertion in model container [2025-01-10 00:42:40,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:42:40" (1/1) ... [2025-01-10 00:42:40,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:42:41,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:42:41,242 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:42:41,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:42:41,327 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:42:41,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41 WrapperNode [2025-01-10 00:42:41,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:42:41,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:42:41,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:42:41,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:42:41,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,365 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2025-01-10 00:42:41,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:42:41,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:42:41,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:42:41,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:42:41,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,390 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:42:41,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:42:41,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:42:41,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:42:41,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:42:41,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (1/1) ... [2025-01-10 00:42:41,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:41,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:41,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:42:41,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:42:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:42:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:42:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:42:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:42:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:42:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:42:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:42:41,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:42:41,474 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:42:41,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:42:41,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:42:41,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:42:41,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:42:41,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:42:41,475 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:42:41,592 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:42:41,594 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:42:41,887 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:42:41,887 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:42:42,090 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:42:42,091 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:42:42,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:42 BoogieIcfgContainer [2025-01-10 00:42:42,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:42:42,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:42:42,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:42:42,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:42:42,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:42:40" (1/3) ... [2025-01-10 00:42:42,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffd4d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:42:42, skipping insertion in model container [2025-01-10 00:42:42,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:41" (2/3) ... [2025-01-10 00:42:42,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffd4d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:42:42, skipping insertion in model container [2025-01-10 00:42:42,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:42" (3/3) ... [2025-01-10 00:42:42,099 INFO L128 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2025-01-10 00:42:42,110 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:42:42,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix013.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:42:42,112 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:42:42,170 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:42:42,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:42:42,234 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-10 00:42:42,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:42,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-01-10 00:42:42,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:42:42,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-01-10 00:42:42,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:42:42,264 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@314d05bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:42:42,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:42:42,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:42:42,277 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-01-10 00:42:42,277 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:42,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:42,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:42,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:42,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash -951107217, now seen corresponding path program 1 times [2025-01-10 00:42:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351838705] [2025-01-10 00:42:42,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:42,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:42:42,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:42:42,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:42,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351838705] [2025-01-10 00:42:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351838705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:42,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:42,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:42,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772142249] [2025-01-10 00:42:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:42,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:42,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:42,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:42,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:42,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2025-01-10 00:42:42,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:42,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:42,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2025-01-10 00:42:42,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:43,290 INFO L124 PetriNetUnfolderBase]: 1175/2001 cut-off events. [2025-01-10 00:42:43,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:43,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3737 conditions, 2001 events. 1175/2001 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14598 event pairs, 199 based on Foata normal form. 120/2080 useless extension candidates. Maximal degree in co-relation 3725. Up to 1361 conditions per place. [2025-01-10 00:42:43,309 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-01-10 00:42:43,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 196 flow [2025-01-10 00:42:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-01-10 00:42:43,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2025-01-10 00:42:43,319 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 123 transitions. [2025-01-10 00:42:43,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 196 flow [2025-01-10 00:42:43,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:42:43,328 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-01-10 00:42:43,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-01-10 00:42:43,337 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-01-10 00:42:43,337 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-01-10 00:42:43,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:43,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:43,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:43,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:42:43,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:43,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1486059607, now seen corresponding path program 1 times [2025-01-10 00:42:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:43,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805705477] [2025-01-10 00:42:43,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:43,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:42:43,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:42:43,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:43,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805705477] [2025-01-10 00:42:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805705477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:43,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794819605] [2025-01-10 00:42:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:43,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:43,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:43,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:43,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2025-01-10 00:42:43,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:43,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:43,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2025-01-10 00:42:43,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:43,675 INFO L124 PetriNetUnfolderBase]: 1027/1865 cut-off events. [2025-01-10 00:42:43,675 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-01-10 00:42:43,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1865 events. 1027/1865 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14351 event pairs, 1027 based on Foata normal form. 60/1860 useless extension candidates. Maximal degree in co-relation 3465. Up to 1484 conditions per place. [2025-01-10 00:42:43,690 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-01-10 00:42:43,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 146 flow [2025-01-10 00:42:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-01-10 00:42:43,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-01-10 00:42:43,692 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 104 transitions. [2025-01-10 00:42:43,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 146 flow [2025-01-10 00:42:43,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:43,696 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-01-10 00:42:43,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-01-10 00:42:43,697 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 00:42:43,697 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-01-10 00:42:43,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:43,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:43,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:43,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:42:43,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:43,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:43,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1486060825, now seen corresponding path program 1 times [2025-01-10 00:42:43,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:43,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815496679] [2025-01-10 00:42:43,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:43,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:43,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:42:43,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:42:43,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:43,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:43,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815496679] [2025-01-10 00:42:43,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815496679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:43,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:43,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009228656] [2025-01-10 00:42:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:43,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:43,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:43,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:43,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:43,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-01-10 00:42:43,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:43,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:43,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-01-10 00:42:43,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:44,336 INFO L124 PetriNetUnfolderBase]: 1327/2237 cut-off events. [2025-01-10 00:42:44,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:44,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 2237 events. 1327/2237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16689 event pairs, 307 based on Foata normal form. 0/2160 useless extension candidates. Maximal degree in co-relation 4201. Up to 853 conditions per place. [2025-01-10 00:42:44,347 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 27 selfloop transitions, 2 changer transitions 36/86 dead transitions. [2025-01-10 00:42:44,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 312 flow [2025-01-10 00:42:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:42:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:42:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2025-01-10 00:42:44,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 00:42:44,351 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 275 transitions. [2025-01-10 00:42:44,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 312 flow [2025-01-10 00:42:44,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:42:44,354 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 111 flow [2025-01-10 00:42:44,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-01-10 00:42:44,355 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-01-10 00:42:44,355 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 111 flow [2025-01-10 00:42:44,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:44,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:44,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:44,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:42:44,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:44,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2131020118, now seen corresponding path program 1 times [2025-01-10 00:42:44,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:44,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424452099] [2025-01-10 00:42:44,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:44,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:42:44,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:42:44,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:44,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:44,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:44,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424452099] [2025-01-10 00:42:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424452099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:44,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109582265] [2025-01-10 00:42:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:44,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:44,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:44,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:44,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-01-10 00:42:44,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:44,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:44,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-01-10 00:42:44,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:44,969 INFO L124 PetriNetUnfolderBase]: 1427/2511 cut-off events. [2025-01-10 00:42:44,969 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2025-01-10 00:42:44,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5081 conditions, 2511 events. 1427/2511 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 17039 event pairs, 401 based on Foata normal form. 54/2516 useless extension candidates. Maximal degree in co-relation 5069. Up to 1349 conditions per place. [2025-01-10 00:42:44,981 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 35 selfloop transitions, 2 changer transitions 27/84 dead transitions. [2025-01-10 00:42:44,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 338 flow [2025-01-10 00:42:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:42:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:42:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2025-01-10 00:42:44,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625974025974026 [2025-01-10 00:42:44,982 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 111 flow. Second operand 7 states and 241 transitions. [2025-01-10 00:42:44,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 338 flow [2025-01-10 00:42:44,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 316 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 00:42:44,987 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 115 flow [2025-01-10 00:42:44,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-01-10 00:42:44,988 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2025-01-10 00:42:44,988 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 115 flow [2025-01-10 00:42:44,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:44,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:44,988 INFO L206 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] [2025-01-10 00:42:44,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:42:44,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:44,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash 140782018, now seen corresponding path program 1 times [2025-01-10 00:42:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:44,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172453128] [2025-01-10 00:42:44,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:45,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:42:45,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:42:45,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:45,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:45,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:45,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172453128] [2025-01-10 00:42:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172453128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:42:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087542861] [2025-01-10 00:42:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:45,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:42:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:45,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:42:45,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:42:45,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:42:45,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:45,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:45,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:42:45,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:46,043 INFO L124 PetriNetUnfolderBase]: 4223/6312 cut-off events. [2025-01-10 00:42:46,043 INFO L125 PetriNetUnfolderBase]: For 700/700 co-relation queries the response was YES. [2025-01-10 00:42:46,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13345 conditions, 6312 events. 4223/6312 cut-off events. For 700/700 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 41344 event pairs, 603 based on Foata normal form. 216/6516 useless extension candidates. Maximal degree in co-relation 13332. Up to 3483 conditions per place. [2025-01-10 00:42:46,117 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 47 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2025-01-10 00:42:46,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 287 flow [2025-01-10 00:42:46,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:42:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:42:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-01-10 00:42:46,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2025-01-10 00:42:46,122 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 115 flow. Second operand 4 states and 148 transitions. [2025-01-10 00:42:46,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 287 flow [2025-01-10 00:42:46,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 275 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-10 00:42:46,143 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 145 flow [2025-01-10 00:42:46,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-01-10 00:42:46,144 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2025-01-10 00:42:46,144 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 145 flow [2025-01-10 00:42:46,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:46,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:46,144 INFO L206 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] [2025-01-10 00:42:46,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:42:46,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:46,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash -871353353, now seen corresponding path program 1 times [2025-01-10 00:42:46,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:46,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580756572] [2025-01-10 00:42:46,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:46,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:46,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:42:46,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:42:46,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:46,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:46,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:46,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580756572] [2025-01-10 00:42:46,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580756572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:46,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:46,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:46,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136554121] [2025-01-10 00:42:46,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:46,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:46,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:46,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:46,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:46,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:42:46,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:46,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:46,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:42:46,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:46,894 INFO L124 PetriNetUnfolderBase]: 3605/5432 cut-off events. [2025-01-10 00:42:46,895 INFO L125 PetriNetUnfolderBase]: For 1665/1671 co-relation queries the response was YES. [2025-01-10 00:42:46,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13172 conditions, 5432 events. 3605/5432 cut-off events. For 1665/1671 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 34196 event pairs, 213 based on Foata normal form. 210/5630 useless extension candidates. Maximal degree in co-relation 13161. Up to 2673 conditions per place. [2025-01-10 00:42:46,926 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 60 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2025-01-10 00:42:46,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 401 flow [2025-01-10 00:42:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:42:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:42:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2025-01-10 00:42:46,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6836363636363636 [2025-01-10 00:42:46,928 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 145 flow. Second operand 5 states and 188 transitions. [2025-01-10 00:42:46,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 401 flow [2025-01-10 00:42:46,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:46,931 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 197 flow [2025-01-10 00:42:46,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-01-10 00:42:46,932 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-01-10 00:42:46,932 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 197 flow [2025-01-10 00:42:46,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:46,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:46,932 INFO L206 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] [2025-01-10 00:42:46,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:42:46,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:46,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1075317448, now seen corresponding path program 1 times [2025-01-10 00:42:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327869955] [2025-01-10 00:42:46,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:46,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:42:46,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:42:46,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:46,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327869955] [2025-01-10 00:42:47,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327869955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:47,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586434954] [2025-01-10 00:42:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:47,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:47,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:47,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:47,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:47,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:42:47,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:47,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:47,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:42:47,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:47,490 INFO L124 PetriNetUnfolderBase]: 2467/3738 cut-off events. [2025-01-10 00:42:47,491 INFO L125 PetriNetUnfolderBase]: For 3177/3189 co-relation queries the response was YES. [2025-01-10 00:42:47,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10132 conditions, 3738 events. 2467/3738 cut-off events. For 3177/3189 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 20922 event pairs, 81 based on Foata normal form. 168/3894 useless extension candidates. Maximal degree in co-relation 10119. Up to 1249 conditions per place. [2025-01-10 00:42:47,507 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 71 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2025-01-10 00:42:47,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 525 flow [2025-01-10 00:42:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:42:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:42:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2025-01-10 00:42:47,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6848484848484848 [2025-01-10 00:42:47,508 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 197 flow. Second operand 6 states and 226 transitions. [2025-01-10 00:42:47,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 525 flow [2025-01-10 00:42:47,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 495 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:42:47,513 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 247 flow [2025-01-10 00:42:47,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2025-01-10 00:42:47,514 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-01-10 00:42:47,514 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 247 flow [2025-01-10 00:42:47,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:47,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:47,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:47,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:42:47,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:47,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash 904490955, now seen corresponding path program 1 times [2025-01-10 00:42:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:47,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224213868] [2025-01-10 00:42:47,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:47,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:42:47,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:42:47,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:47,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:48,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224213868] [2025-01-10 00:42:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224213868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:48,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:42:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078877896] [2025-01-10 00:42:48,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:48,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:42:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:48,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:42:48,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:42:48,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:42:48,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 247 flow. Second operand has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:48,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:48,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:42:48,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:49,164 INFO L124 PetriNetUnfolderBase]: 5641/9212 cut-off events. [2025-01-10 00:42:49,164 INFO L125 PetriNetUnfolderBase]: For 5510/6121 co-relation queries the response was YES. [2025-01-10 00:42:49,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22454 conditions, 9212 events. 5641/9212 cut-off events. For 5510/6121 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 61068 event pairs, 1225 based on Foata normal form. 257/9061 useless extension candidates. Maximal degree in co-relation 22440. Up to 4014 conditions per place. [2025-01-10 00:42:49,202 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 91 selfloop transitions, 36 changer transitions 29/184 dead transitions. [2025-01-10 00:42:49,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 184 transitions, 868 flow [2025-01-10 00:42:49,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:42:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 00:42:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 494 transitions. [2025-01-10 00:42:49,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5613636363636364 [2025-01-10 00:42:49,206 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 247 flow. Second operand 16 states and 494 transitions. [2025-01-10 00:42:49,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 184 transitions, 868 flow [2025-01-10 00:42:49,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 184 transitions, 821 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-01-10 00:42:49,230 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 436 flow [2025-01-10 00:42:49,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=436, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2025-01-10 00:42:49,232 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2025-01-10 00:42:49,232 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 436 flow [2025-01-10 00:42:49,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:49,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:49,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:49,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:42:49,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:49,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:49,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1091302579, now seen corresponding path program 2 times [2025-01-10 00:42:49,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:49,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410121100] [2025-01-10 00:42:49,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:42:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:49,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:42:49,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:42:49,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:42:49,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:49,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410121100] [2025-01-10 00:42:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410121100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:49,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:49,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:42:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112346685] [2025-01-10 00:42:49,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:49,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:49,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:49,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:49,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:42:49,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:49,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:49,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:42:49,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:50,843 INFO L124 PetriNetUnfolderBase]: 7720/12681 cut-off events. [2025-01-10 00:42:50,844 INFO L125 PetriNetUnfolderBase]: For 13282/13710 co-relation queries the response was YES. [2025-01-10 00:42:50,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35390 conditions, 12681 events. 7720/12681 cut-off events. For 13282/13710 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 88733 event pairs, 2643 based on Foata normal form. 315/12353 useless extension candidates. Maximal degree in co-relation 35370. Up to 7219 conditions per place. [2025-01-10 00:42:50,915 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 105 selfloop transitions, 31 changer transitions 27/195 dead transitions. [2025-01-10 00:42:50,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 195 transitions, 1181 flow [2025-01-10 00:42:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:42:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:42:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 299 transitions. [2025-01-10 00:42:50,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.604040404040404 [2025-01-10 00:42:50,917 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 436 flow. Second operand 9 states and 299 transitions. [2025-01-10 00:42:50,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 195 transitions, 1181 flow [2025-01-10 00:42:50,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 195 transitions, 1165 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:50,955 INFO L231 Difference]: Finished difference. Result has 92 places, 116 transitions, 699 flow [2025-01-10 00:42:50,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=699, PETRI_PLACES=92, PETRI_TRANSITIONS=116} [2025-01-10 00:42:50,956 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2025-01-10 00:42:50,956 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 116 transitions, 699 flow [2025-01-10 00:42:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:50,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:50,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:50,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:42:50,956 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:50,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:50,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1820846535, now seen corresponding path program 3 times [2025-01-10 00:42:50,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:50,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728995265] [2025-01-10 00:42:50,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:42:50,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:50,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:42:50,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:42:50,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:42:50,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728995265] [2025-01-10 00:42:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728995265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:51,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:42:51,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840607057] [2025-01-10 00:42:51,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:51,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:42:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:51,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:42:51,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:42:51,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:42:51,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 116 transitions, 699 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:51,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:51,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:42:51,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:52,895 INFO L124 PetriNetUnfolderBase]: 10023/16441 cut-off events. [2025-01-10 00:42:52,899 INFO L125 PetriNetUnfolderBase]: For 35582/36243 co-relation queries the response was YES. [2025-01-10 00:42:52,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51111 conditions, 16441 events. 10023/16441 cut-off events. For 35582/36243 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 121653 event pairs, 3184 based on Foata normal form. 349/15832 useless extension candidates. Maximal degree in co-relation 51085. Up to 6776 conditions per place. [2025-01-10 00:42:53,064 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 121 selfloop transitions, 25 changer transitions 18/196 dead transitions. [2025-01-10 00:42:53,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 196 transitions, 1453 flow [2025-01-10 00:42:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:42:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:42:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 272 transitions. [2025-01-10 00:42:53,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2025-01-10 00:42:53,074 INFO L175 Difference]: Start difference. First operand has 92 places, 116 transitions, 699 flow. Second operand 8 states and 272 transitions. [2025-01-10 00:42:53,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 196 transitions, 1453 flow [2025-01-10 00:42:53,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 196 transitions, 1435 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:53,144 INFO L231 Difference]: Finished difference. Result has 96 places, 116 transitions, 749 flow [2025-01-10 00:42:53,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=749, PETRI_PLACES=96, PETRI_TRANSITIONS=116} [2025-01-10 00:42:53,146 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 34 predicate places. [2025-01-10 00:42:53,147 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 116 transitions, 749 flow [2025-01-10 00:42:53,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:53,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:53,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:53,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:42:53,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:53,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:53,149 INFO L85 PathProgramCache]: Analyzing trace with hash -708344051, now seen corresponding path program 4 times [2025-01-10 00:42:53,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720980217] [2025-01-10 00:42:53,149 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:42:53,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:53,161 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-01-10 00:42:53,174 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:42:53,175 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:42:53,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:53,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720980217] [2025-01-10 00:42:53,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720980217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:53,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:53,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:42:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835941842] [2025-01-10 00:42:53,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:53,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:53,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:53,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:53,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2025-01-10 00:42:53,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 116 transitions, 749 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:53,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:53,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2025-01-10 00:42:53,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:55,528 INFO L124 PetriNetUnfolderBase]: 10973/19078 cut-off events. [2025-01-10 00:42:55,529 INFO L125 PetriNetUnfolderBase]: For 33644/35363 co-relation queries the response was YES. [2025-01-10 00:42:55,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55637 conditions, 19078 events. 10973/19078 cut-off events. For 33644/35363 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 159043 event pairs, 4418 based on Foata normal form. 439/18130 useless extension candidates. Maximal degree in co-relation 55608. Up to 7333 conditions per place. [2025-01-10 00:42:55,608 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 44/164 dead transitions. [2025-01-10 00:42:55,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 164 transitions, 1177 flow [2025-01-10 00:42:55,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:42:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:42:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-01-10 00:42:55,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-01-10 00:42:55,609 INFO L175 Difference]: Start difference. First operand has 96 places, 116 transitions, 749 flow. Second operand 6 states and 215 transitions. [2025-01-10 00:42:55,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 164 transitions, 1177 flow [2025-01-10 00:42:55,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 164 transitions, 1147 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:42:55,690 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 601 flow [2025-01-10 00:42:55,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2025-01-10 00:42:55,690 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2025-01-10 00:42:55,690 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 601 flow [2025-01-10 00:42:55,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:55,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:55,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:55,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:42:55,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1936390377, now seen corresponding path program 5 times [2025-01-10 00:42:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106531448] [2025-01-10 00:42:55,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:42:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:55,698 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:42:55,714 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:42:55,714 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:42:55,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:55,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:55,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106531448] [2025-01-10 00:42:55,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106531448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:55,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:55,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:42:55,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070988305] [2025-01-10 00:42:55,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:55,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:42:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:55,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:42:55,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:42:55,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:42:55,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 601 flow. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:55,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:55,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:42:55,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:56,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,721 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-10 00:42:56,722 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 00:42:56,722 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 00:42:56,722 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 00:42:56,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,811 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,811 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,811 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,811 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,815 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,815 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,815 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,815 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,819 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,819 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,819 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,819 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 00:42:56,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,821 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,821 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,821 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,821 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,885 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,885 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,885 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,885 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,891 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,891 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,891 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,891 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,893 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,893 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,893 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,893 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2025-01-10 00:42:56,894 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,894 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,895 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,895 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,897 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,897 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,898 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,898 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 00:42:56,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 59#L857true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2025-01-10 00:42:56,905 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,905 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,905 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,905 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,906 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,906 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,906 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,906 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,960 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,960 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,960 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,960 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,960 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,960 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,960 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,960 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,961 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,961 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,961 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,961 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,966 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,966 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,966 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,966 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 59#L857true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2025-01-10 00:42:56,968 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,968 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,968 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,969 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,969 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,969 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,969 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,969 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:56,981 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,981 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,981 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,981 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:56,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2025-01-10 00:42:56,983 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,983 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,983 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,983 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2025-01-10 00:42:56,984 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,984 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,984 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:56,984 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,029 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 00:42:57,029 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:57,029 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:57,029 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 00:42:57,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,031 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,031 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,031 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,031 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,032 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,032 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,032 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,032 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,033 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,033 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,033 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,033 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,033 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,033 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,033 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,033 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,039 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,039 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,039 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,039 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2025-01-10 00:42:57,040 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,040 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,041 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,041 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2025-01-10 00:42:57,041 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,041 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,041 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,041 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,048 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,048 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,048 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,048 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,051 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,051 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,051 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,051 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2025-01-10 00:42:57,053 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,053 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,053 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,053 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,091 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,091 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,091 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,091 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,092 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,092 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,092 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,092 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,094 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,095 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,095 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,095 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 00:42:57,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,096 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,096 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,096 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,096 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,096 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,097 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,097 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,097 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,097 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,097 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,097 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,097 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,100 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,100 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,100 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,100 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,103 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,103 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,103 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,103 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2025-01-10 00:42:57,104 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,104 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,104 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,104 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,114 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,114 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,114 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,114 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,114 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,114 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,114 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,114 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,142 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,142 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,142 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,142 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,144 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,144 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,144 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,144 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,145 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,145 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,145 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,146 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,146 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,146 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,147 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,147 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 00:42:57,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,149 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,149 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,149 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,149 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,151 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,151 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,151 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,151 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,152 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,152 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,152 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,152 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,175 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,175 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,175 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,175 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,193 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,193 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,193 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,193 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,194 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,194 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,194 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,194 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,196 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,197 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,197 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,197 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 00:42:57,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,200 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2025-01-10 00:42:57,200 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 00:42:57,200 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 00:42:57,200 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 00:42:57,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2025-01-10 00:42:57,221 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2025-01-10 00:42:57,222 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 00:42:57,222 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 00:42:57,222 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 00:42:57,282 INFO L124 PetriNetUnfolderBase]: 12850/19178 cut-off events. [2025-01-10 00:42:57,282 INFO L125 PetriNetUnfolderBase]: For 28910/31531 co-relation queries the response was YES. [2025-01-10 00:42:57,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57268 conditions, 19178 events. 12850/19178 cut-off events. For 28910/31531 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 132386 event pairs, 560 based on Foata normal form. 1135/19763 useless extension candidates. Maximal degree in co-relation 57239. Up to 6480 conditions per place. [2025-01-10 00:42:57,419 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 57 selfloop transitions, 18 changer transitions 76/169 dead transitions. [2025-01-10 00:42:57,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 169 transitions, 1147 flow [2025-01-10 00:42:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:42:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:42:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2025-01-10 00:42:57,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638961038961039 [2025-01-10 00:42:57,420 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 601 flow. Second operand 7 states and 246 transitions. [2025-01-10 00:42:57,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 169 transitions, 1147 flow [2025-01-10 00:42:57,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 169 transitions, 1071 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-01-10 00:42:57,565 INFO L231 Difference]: Finished difference. Result has 98 places, 61 transitions, 345 flow [2025-01-10 00:42:57,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=345, PETRI_PLACES=98, PETRI_TRANSITIONS=61} [2025-01-10 00:42:57,566 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2025-01-10 00:42:57,566 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 61 transitions, 345 flow [2025-01-10 00:42:57,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:57,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:57,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:57,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:42:57,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:57,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:57,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2143477423, now seen corresponding path program 1 times [2025-01-10 00:42:57,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:57,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957570965] [2025-01-10 00:42:57,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:57,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:57,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:42:57,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:42:57,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:57,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957570965] [2025-01-10 00:42:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957570965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:57,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:57,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:42:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13700783] [2025-01-10 00:42:57,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:57,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:57,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:57,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:57,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2025-01-10 00:42:57,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 61 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:57,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:57,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2025-01-10 00:42:57,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:58,227 INFO L124 PetriNetUnfolderBase]: 2105/3957 cut-off events. [2025-01-10 00:42:58,227 INFO L125 PetriNetUnfolderBase]: For 7687/8061 co-relation queries the response was YES. [2025-01-10 00:42:58,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11873 conditions, 3957 events. 2105/3957 cut-off events. For 7687/8061 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 27972 event pairs, 568 based on Foata normal form. 30/3681 useless extension candidates. Maximal degree in co-relation 11845. Up to 1428 conditions per place. [2025-01-10 00:42:58,250 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 39 selfloop transitions, 2 changer transitions 19/92 dead transitions. [2025-01-10 00:42:58,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 575 flow [2025-01-10 00:42:58,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:42:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:42:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2025-01-10 00:42:58,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-01-10 00:42:58,251 INFO L175 Difference]: Start difference. First operand has 98 places, 61 transitions, 345 flow. Second operand 6 states and 200 transitions. [2025-01-10 00:42:58,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 575 flow [2025-01-10 00:42:58,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 417 flow, removed 48 selfloop flow, removed 18 redundant places. [2025-01-10 00:42:58,276 INFO L231 Difference]: Finished difference. Result has 80 places, 58 transitions, 218 flow [2025-01-10 00:42:58,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=80, PETRI_TRANSITIONS=58} [2025-01-10 00:42:58,278 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 18 predicate places. [2025-01-10 00:42:58,278 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 58 transitions, 218 flow [2025-01-10 00:42:58,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:58,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:58,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:58,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:42:58,278 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:42:58,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1479410719, now seen corresponding path program 2 times [2025-01-10 00:42:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:58,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502637536] [2025-01-10 00:42:58,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:42:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:58,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:42:58,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:42:58,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:42:58,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:42:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502637536] [2025-01-10 00:42:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502637536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:59,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:59,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:42:59,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991126321] [2025-01-10 00:42:59,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:59,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:42:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:59,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:42:59,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:42:59,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-01-10 00:42:59,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 58 transitions, 218 flow. Second operand has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:59,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:59,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-01-10 00:42:59,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:00,444 INFO L124 PetriNetUnfolderBase]: 2053/3844 cut-off events. [2025-01-10 00:43:00,444 INFO L125 PetriNetUnfolderBase]: For 726/746 co-relation queries the response was YES. [2025-01-10 00:43:00,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8141 conditions, 3844 events. 2053/3844 cut-off events. For 726/746 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 26959 event pairs, 558 based on Foata normal form. 16/3509 useless extension candidates. Maximal degree in co-relation 8123. Up to 1374 conditions per place. [2025-01-10 00:43:00,462 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 32 selfloop transitions, 7 changer transitions 17/91 dead transitions. [2025-01-10 00:43:00,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 91 transitions, 406 flow [2025-01-10 00:43:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:43:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:43:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 315 transitions. [2025-01-10 00:43:00,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2025-01-10 00:43:00,463 INFO L175 Difference]: Start difference. First operand has 80 places, 58 transitions, 218 flow. Second operand 10 states and 315 transitions. [2025-01-10 00:43:00,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 91 transitions, 406 flow [2025-01-10 00:43:00,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 91 transitions, 395 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 00:43:00,466 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 246 flow [2025-01-10 00:43:00,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=246, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2025-01-10 00:43:00,467 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 25 predicate places. [2025-01-10 00:43:00,467 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 246 flow [2025-01-10 00:43:00,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:00,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:00,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:00,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:43:00,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:00,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1877064649, now seen corresponding path program 3 times [2025-01-10 00:43:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:43:00,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837603016] [2025-01-10 00:43:00,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:43:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:43:00,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:43:00,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:43:00,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:43:00,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:43:00,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:43:00,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:43:00,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:43:00,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:00,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:43:00,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:43:00,604 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:43:00,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:43:00,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:43:00,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:43:00,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:43:00,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:43:00,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:43:00,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:43:00,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:43:00,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:43:00,607 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:00,679 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:43:00,679 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:43:00,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:43:00 BasicIcfg [2025-01-10 00:43:00,683 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:43:00,683 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:43:00,683 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:43:00,683 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:43:00,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:42" (3/4) ... [2025-01-10 00:43:00,685 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:43:00,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:43:00,686 INFO L158 Benchmark]: Toolchain (without parser) took 19768.03ms. Allocated memory was 142.6MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 111.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-01-10 00:43:00,686 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:43:00,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.99ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 87.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:43:00,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.75ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 84.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:43:00,687 INFO L158 Benchmark]: Boogie Preprocessor took 46.54ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:43:00,687 INFO L158 Benchmark]: RCFGBuilder took 678.38ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 91.5MB in the end (delta: -10.6MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2025-01-10 00:43:00,687 INFO L158 Benchmark]: TraceAbstraction took 18590.03ms. Allocated memory was 142.6MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 90.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-10 00:43:00,687 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 3.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 195.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:43:00,688 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.78ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.99ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 87.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.75ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 84.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.54ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 678.38ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 91.5MB in the end (delta: -10.6MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18590.03ms. Allocated memory was 142.6MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 90.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 3.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 195.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-4, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-4, t326=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, t328=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, t328=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, t328=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, t328=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix013.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 872]: 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: 874]: 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: 878]: 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, 89 locations, 8 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: 18.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 870 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 817 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2252 IncrementalHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 49 mSDtfsCounter, 2252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=749occurred in iteration=10, InterpolantAutomatonStates: 98, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 2627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:43:00,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:43:03,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:43:03,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:43:03,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:43:03,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:43:03,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:43:03,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:43:03,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:43:03,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:43:03,461 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:43:03,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:43:03,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:43:03,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:43:03,462 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:43:03,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:43:03,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:43:03,464 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:43:03,464 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:43:03,464 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:43:03,464 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:43:03,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:43:03,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:43:03,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:43:03,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:43:03,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:43:03,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:43:03,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:43:03,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:43:03,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:43:03,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:43:03,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:43:03,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:43:03,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:43:03,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:43:03,467 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:43:03,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:43:03,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:43:03,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:43:03,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:43:03,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:43:03,467 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2025-01-10 00:43:03,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:43:03,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:43:03,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:43:03,682 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:43:03,682 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:43:03,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2025-01-10 00:43:04,942 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb7813c73/3432012bbde246d1bfc7510f948392f9/FLAGc8c5ecc26 [2025-01-10 00:43:05,202 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:43:05,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2025-01-10 00:43:05,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb7813c73/3432012bbde246d1bfc7510f948392f9/FLAGc8c5ecc26 [2025-01-10 00:43:05,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb7813c73/3432012bbde246d1bfc7510f948392f9 [2025-01-10 00:43:05,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:43:05,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:43:05,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:43:05,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:43:05,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:43:05,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa00c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05, skipping insertion in model container [2025-01-10 00:43:05,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:43:05,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:43:05,831 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:43:05,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:43:05,907 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:43:05,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05 WrapperNode [2025-01-10 00:43:05,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:43:05,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:43:05,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:43:05,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:43:05,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,938 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2025-01-10 00:43:05,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:43:05,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:43:05,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:43:05,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:43:05,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,974 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:43:05,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:05,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:06,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:06,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:43:06,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:43:06,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:43:06,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:43:06,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (1/1) ... [2025-01-10 00:43:06,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:43:06,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:06,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:43:06,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:43:06,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:43:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:43:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:43:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:43:06,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:43:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:43:06,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:43:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:43:06,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:43:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:43:06,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:43:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:43:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:43:06,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:43:06,070 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:43:06,172 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:43:06,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:43:06,536 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:43:06,538 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:43:06,733 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:43:06,733 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:43:06,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:43:06 BoogieIcfgContainer [2025-01-10 00:43:06,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:43:06,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:43:06,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:43:06,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:43:06,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:43:05" (1/3) ... [2025-01-10 00:43:06,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab665b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:43:06, skipping insertion in model container [2025-01-10 00:43:06,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:43:05" (2/3) ... [2025-01-10 00:43:06,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab665b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:43:06, skipping insertion in model container [2025-01-10 00:43:06,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:43:06" (3/3) ... [2025-01-10 00:43:06,740 INFO L128 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2025-01-10 00:43:06,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:43:06,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix013.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:43:06,752 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:43:06,802 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:43:06,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:43:06,846 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-10 00:43:06,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:43:06,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-01-10 00:43:06,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:43:06,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-01-10 00:43:06,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:43:06,865 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24ac78a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:43:06,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:43:06,873 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:43:06,873 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-01-10 00:43:06,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:43:06,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:06,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:06,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:06,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:06,878 INFO L85 PathProgramCache]: Analyzing trace with hash 12604335, now seen corresponding path program 1 times [2025-01-10 00:43:06,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:06,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384961849] [2025-01-10 00:43:06,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:06,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:06,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:06,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:06,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:43:06,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:43:06,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:43:06,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:06,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:06,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:43:06,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:07,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:07,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384961849] [2025-01-10 00:43:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384961849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:07,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:07,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:43:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960932485] [2025-01-10 00:43:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:07,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:43:07,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:07,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:43:07,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:43:07,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2025-01-10 00:43:07,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:07,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:07,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2025-01-10 00:43:07,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:07,445 INFO L124 PetriNetUnfolderBase]: 1175/1905 cut-off events. [2025-01-10 00:43:07,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:43:07,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 1905 events. 1175/1905 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 12218 event pairs, 343 based on Foata normal form. 120/1994 useless extension candidates. Maximal degree in co-relation 3629. Up to 1361 conditions per place. [2025-01-10 00:43:07,470 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-01-10 00:43:07,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 196 flow [2025-01-10 00:43:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:43:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:43:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-01-10 00:43:07,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2025-01-10 00:43:07,481 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 123 transitions. [2025-01-10 00:43:07,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 196 flow [2025-01-10 00:43:07,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:43:07,488 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-01-10 00:43:07,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-01-10 00:43:07,492 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-01-10 00:43:07,492 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-01-10 00:43:07,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:07,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:07,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:07,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:43:07,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:07,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:07,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash 147367257, now seen corresponding path program 1 times [2025-01-10 00:43:07,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:07,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871417807] [2025-01-10 00:43:07,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:07,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:07,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:07,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:07,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:43:07,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:43:07,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:43:07,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:07,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:07,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:43:07,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:07,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:07,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:07,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871417807] [2025-01-10 00:43:07,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871417807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:07,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:07,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:43:07,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265601736] [2025-01-10 00:43:07,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:07,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:43:07,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:07,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:43:07,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:43:07,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2025-01-10 00:43:07,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:07,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:07,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2025-01-10 00:43:07,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:08,107 INFO L124 PetriNetUnfolderBase]: 1027/1865 cut-off events. [2025-01-10 00:43:08,108 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-01-10 00:43:08,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1865 events. 1027/1865 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14008 event pairs, 1027 based on Foata normal form. 60/1880 useless extension candidates. Maximal degree in co-relation 3465. Up to 1484 conditions per place. [2025-01-10 00:43:08,120 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-01-10 00:43:08,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 146 flow [2025-01-10 00:43:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:43:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:43:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-01-10 00:43:08,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-01-10 00:43:08,124 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 104 transitions. [2025-01-10 00:43:08,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 146 flow [2025-01-10 00:43:08,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:43:08,127 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-01-10 00:43:08,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-01-10 00:43:08,128 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 00:43:08,128 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-01-10 00:43:08,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:08,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:08,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:08,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:43:08,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:08,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:08,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:08,332 INFO L85 PathProgramCache]: Analyzing trace with hash 147368475, now seen corresponding path program 1 times [2025-01-10 00:43:08,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:08,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053106600] [2025-01-10 00:43:08,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:08,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:08,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:08,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:08,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:43:08,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:43:08,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:43:08,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:08,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:08,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:43:08,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:08,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:08,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053106600] [2025-01-10 00:43:08,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053106600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:08,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:08,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:43:08,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151632210] [2025-01-10 00:43:08,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:08,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:43:08,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:08,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:43:08,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:43:08,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:43:08,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:08,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:08,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:43:08,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:09,235 INFO L124 PetriNetUnfolderBase]: 4635/7272 cut-off events. [2025-01-10 00:43:09,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:43:09,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13794 conditions, 7272 events. 4635/7272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 50998 event pairs, 603 based on Foata normal form. 216/7476 useless extension candidates. Maximal degree in co-relation 13788. Up to 4031 conditions per place. [2025-01-10 00:43:09,286 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 47 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2025-01-10 00:43:09,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 268 flow [2025-01-10 00:43:09,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:43:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:43:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-01-10 00:43:09,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2025-01-10 00:43:09,290 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 148 transitions. [2025-01-10 00:43:09,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 268 flow [2025-01-10 00:43:09,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:43:09,292 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2025-01-10 00:43:09,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-01-10 00:43:09,293 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-01-10 00:43:09,293 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2025-01-10 00:43:09,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:09,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:09,294 INFO L206 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] [2025-01-10 00:43:09,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:43:09,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:09,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:09,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash 990555212, now seen corresponding path program 1 times [2025-01-10 00:43:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:09,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738812283] [2025-01-10 00:43:09,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:09,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:09,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:09,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:09,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:43:09,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:43:09,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:43:09,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:09,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:09,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:43:09,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:09,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:09,612 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:09,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738812283] [2025-01-10 00:43:09,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738812283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:09,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:09,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:43:09,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495875889] [2025-01-10 00:43:09,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:09,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:43:09,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:09,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:43:09,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:43:09,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:43:09,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:09,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:09,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:43:09,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:10,179 INFO L124 PetriNetUnfolderBase]: 3877/6108 cut-off events. [2025-01-10 00:43:10,180 INFO L125 PetriNetUnfolderBase]: For 1597/1605 co-relation queries the response was YES. [2025-01-10 00:43:10,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13851 conditions, 6108 events. 3877/6108 cut-off events. For 1597/1605 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 41027 event pairs, 213 based on Foata normal form. 210/6306 useless extension candidates. Maximal degree in co-relation 13842. Up to 3041 conditions per place. [2025-01-10 00:43:10,209 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 60 selfloop transitions, 10 changer transitions 1/89 dead transitions. [2025-01-10 00:43:10,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 392 flow [2025-01-10 00:43:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:43:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:43:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2025-01-10 00:43:10,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6836363636363636 [2025-01-10 00:43:10,213 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 188 transitions. [2025-01-10 00:43:10,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 392 flow [2025-01-10 00:43:10,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 89 transitions, 381 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:43:10,217 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2025-01-10 00:43:10,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2025-01-10 00:43:10,219 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-01-10 00:43:10,219 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2025-01-10 00:43:10,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:10,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:10,219 INFO L206 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] [2025-01-10 00:43:10,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:43:10,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:10,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:10,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1847921784, now seen corresponding path program 1 times [2025-01-10 00:43:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:10,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815860295] [2025-01-10 00:43:10,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:10,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:10,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:10,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:10,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:43:10,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:43:10,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:43:10,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:10,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:10,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:43:10,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:10,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:10,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:10,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815860295] [2025-01-10 00:43:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815860295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:10,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:43:10,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100338706] [2025-01-10 00:43:10,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:10,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:43:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:10,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:43:10,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:43:10,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:43:10,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:10,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:10,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:43:10,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:11,040 INFO L124 PetriNetUnfolderBase]: 2547/3978 cut-off events. [2025-01-10 00:43:11,040 INFO L125 PetriNetUnfolderBase]: For 3104/3120 co-relation queries the response was YES. [2025-01-10 00:43:11,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10233 conditions, 3978 events. 2547/3978 cut-off events. For 3104/3120 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 23206 event pairs, 81 based on Foata normal form. 168/4134 useless extension candidates. Maximal degree in co-relation 10222. Up to 1361 conditions per place. [2025-01-10 00:43:11,066 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 71 selfloop transitions, 14 changer transitions 1/104 dead transitions. [2025-01-10 00:43:11,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 104 transitions, 515 flow [2025-01-10 00:43:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:43:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:43:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2025-01-10 00:43:11,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6848484848484848 [2025-01-10 00:43:11,067 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 226 transitions. [2025-01-10 00:43:11,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 104 transitions, 515 flow [2025-01-10 00:43:11,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 485 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:43:11,078 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2025-01-10 00:43:11,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-01-10 00:43:11,080 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-01-10 00:43:11,080 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2025-01-10 00:43:11,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:11,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:11,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:11,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:43:11,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:11,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:11,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1453262887, now seen corresponding path program 1 times [2025-01-10 00:43:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:11,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707201548] [2025-01-10 00:43:11,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:11,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:11,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:11,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:43:11,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:43:11,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:43:11,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:11,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:11,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:43:11,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:11,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:11,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:11,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707201548] [2025-01-10 00:43:11,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707201548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:11,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:11,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:43:11,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174082965] [2025-01-10 00:43:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:43:11,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:11,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:43:11,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:43:11,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:43:11,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:11,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:11,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:43:11,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:11,824 INFO L124 PetriNetUnfolderBase]: 1559/2330 cut-off events. [2025-01-10 00:43:11,824 INFO L125 PetriNetUnfolderBase]: For 3374/3390 co-relation queries the response was YES. [2025-01-10 00:43:11,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6866 conditions, 2330 events. 1559/2330 cut-off events. For 3374/3390 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11593 event pairs, 47 based on Foata normal form. 84/2402 useless extension candidates. Maximal degree in co-relation 6854. Up to 768 conditions per place. [2025-01-10 00:43:11,836 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 64 selfloop transitions, 18 changer transitions 1/101 dead transitions. [2025-01-10 00:43:11,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 513 flow [2025-01-10 00:43:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:43:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:43:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2025-01-10 00:43:11,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638961038961039 [2025-01-10 00:43:11,837 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 246 transitions. [2025-01-10 00:43:11,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 513 flow [2025-01-10 00:43:11,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 101 transitions, 467 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 00:43:11,846 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2025-01-10 00:43:11,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-01-10 00:43:11,847 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-01-10 00:43:11,847 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2025-01-10 00:43:11,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:11,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:11,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:11,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:43:12,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:12,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:12,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:12,049 INFO L85 PathProgramCache]: Analyzing trace with hash -110046723, now seen corresponding path program 1 times [2025-01-10 00:43:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:12,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581924176] [2025-01-10 00:43:12,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:43:12,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:12,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:12,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:12,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:43:12,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:43:12,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:43:12,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:12,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:12,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:43:12,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:12,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:12,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581924176] [2025-01-10 00:43:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581924176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:12,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:12,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:43:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578218751] [2025-01-10 00:43:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:12,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:43:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:12,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:43:12,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:43:12,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 00:43:12,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:12,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:12,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 00:43:12,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:13,322 INFO L124 PetriNetUnfolderBase]: 3897/5733 cut-off events. [2025-01-10 00:43:13,322 INFO L125 PetriNetUnfolderBase]: For 6567/6669 co-relation queries the response was YES. [2025-01-10 00:43:13,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16108 conditions, 5733 events. 3897/5733 cut-off events. For 6567/6669 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 31913 event pairs, 937 based on Foata normal form. 48/5730 useless extension candidates. Maximal degree in co-relation 16095. Up to 3313 conditions per place. [2025-01-10 00:43:13,346 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 57 selfloop transitions, 9 changer transitions 56/137 dead transitions. [2025-01-10 00:43:13,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 137 transitions, 819 flow [2025-01-10 00:43:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:43:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:43:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 287 transitions. [2025-01-10 00:43:13,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5797979797979798 [2025-01-10 00:43:13,348 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 9 states and 287 transitions. [2025-01-10 00:43:13,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 137 transitions, 819 flow [2025-01-10 00:43:13,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 137 transitions, 618 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-01-10 00:43:13,388 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 209 flow [2025-01-10 00:43:13,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=209, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2025-01-10 00:43:13,388 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2025-01-10 00:43:13,389 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 209 flow [2025-01-10 00:43:13,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:13,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:13,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:13,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:43:13,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:13,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:13,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1000494629, now seen corresponding path program 2 times [2025-01-10 00:43:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481207163] [2025-01-10 00:43:13,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:43:13,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:13,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:13,599 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:13,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:43:13,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:43:13,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:43:13,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:43:13,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:13,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:43:13,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:13,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:13,847 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481207163] [2025-01-10 00:43:13,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481207163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:13,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:13,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:43:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863448206] [2025-01-10 00:43:13,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:13,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:43:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:13,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:43:13,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:43:13,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 00:43:13,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 209 flow. Second operand has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:13,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:13,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 00:43:13,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:14,425 INFO L124 PetriNetUnfolderBase]: 4139/6199 cut-off events. [2025-01-10 00:43:14,425 INFO L125 PetriNetUnfolderBase]: For 1613/1885 co-relation queries the response was YES. [2025-01-10 00:43:14,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14635 conditions, 6199 events. 4139/6199 cut-off events. For 1613/1885 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 36402 event pairs, 1025 based on Foata normal form. 96/6224 useless extension candidates. Maximal degree in co-relation 14621. Up to 4023 conditions per place. [2025-01-10 00:43:14,459 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 59 selfloop transitions, 14 changer transitions 47/136 dead transitions. [2025-01-10 00:43:14,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 136 transitions, 704 flow [2025-01-10 00:43:14,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:43:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:43:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 277 transitions. [2025-01-10 00:43:14,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595959595959596 [2025-01-10 00:43:14,463 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 209 flow. Second operand 9 states and 277 transitions. [2025-01-10 00:43:14,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 136 transitions, 704 flow [2025-01-10 00:43:14,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 136 transitions, 650 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-01-10 00:43:14,469 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 267 flow [2025-01-10 00:43:14,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=267, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-01-10 00:43:14,470 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2025-01-10 00:43:14,470 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 267 flow [2025-01-10 00:43:14,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:14,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:14,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:14,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:43:14,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:14,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:14,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash 692855649, now seen corresponding path program 3 times [2025-01-10 00:43:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028367927] [2025-01-10 00:43:14,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:43:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:14,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:14,676 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:14,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:43:14,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:43:14,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:43:14,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:43:14,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:14,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:43:14,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:14,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:14,903 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:14,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028367927] [2025-01-10 00:43:14,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028367927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:14,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:14,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:43:14,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735975683] [2025-01-10 00:43:14,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:14,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:43:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:14,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:43:14,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:43:14,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 00:43:14,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 267 flow. Second operand has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:14,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:14,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 00:43:14,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:15,634 INFO L124 PetriNetUnfolderBase]: 5799/8745 cut-off events. [2025-01-10 00:43:15,634 INFO L125 PetriNetUnfolderBase]: For 2597/2690 co-relation queries the response was YES. [2025-01-10 00:43:15,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21352 conditions, 8745 events. 5799/8745 cut-off events. For 2597/2690 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 53404 event pairs, 1290 based on Foata normal form. 29/8598 useless extension candidates. Maximal degree in co-relation 21336. Up to 4062 conditions per place. [2025-01-10 00:43:15,714 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 68 selfloop transitions, 23 changer transitions 56/164 dead transitions. [2025-01-10 00:43:15,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 164 transitions, 904 flow [2025-01-10 00:43:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:43:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:43:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2025-01-10 00:43:15,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5690909090909091 [2025-01-10 00:43:15,720 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 267 flow. Second operand 10 states and 313 transitions. [2025-01-10 00:43:15,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 164 transitions, 904 flow [2025-01-10 00:43:15,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 164 transitions, 862 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:43:15,723 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 388 flow [2025-01-10 00:43:15,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=388, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-01-10 00:43:15,724 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 19 predicate places. [2025-01-10 00:43:15,724 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 388 flow [2025-01-10 00:43:15,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:15,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:15,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:15,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:43:15,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:15,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:15,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1222905949, now seen corresponding path program 4 times [2025-01-10 00:43:15,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:15,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998581007] [2025-01-10 00:43:15,927 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:43:15,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:15,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:15,931 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:15,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:43:15,999 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-01-10 00:43:16,015 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 39 statements. [2025-01-10 00:43:16,016 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 00:43:16,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:16,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 00:43:16,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:16,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:16,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998581007] [2025-01-10 00:43:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998581007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:16,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:16,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:43:16,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335894401] [2025-01-10 00:43:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:16,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:43:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:16,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:43:16,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:43:16,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-01-10 00:43:16,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 388 flow. Second operand has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:16,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:16,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-01-10 00:43:16,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:17,344 INFO L124 PetriNetUnfolderBase]: 3116/5717 cut-off events. [2025-01-10 00:43:17,344 INFO L125 PetriNetUnfolderBase]: For 1027/1054 co-relation queries the response was YES. [2025-01-10 00:43:17,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12030 conditions, 5717 events. 3116/5717 cut-off events. For 1027/1054 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 43073 event pairs, 965 based on Foata normal form. 17/5256 useless extension candidates. Maximal degree in co-relation 12011. Up to 1567 conditions per place. [2025-01-10 00:43:17,374 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 47 selfloop transitions, 5 changer transitions 17/121 dead transitions. [2025-01-10 00:43:17,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 634 flow [2025-01-10 00:43:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:43:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:43:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 304 transitions. [2025-01-10 00:43:17,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6141414141414141 [2025-01-10 00:43:17,376 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 388 flow. Second operand 9 states and 304 transitions. [2025-01-10 00:43:17,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 634 flow [2025-01-10 00:43:17,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 121 transitions, 612 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-01-10 00:43:17,379 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 422 flow [2025-01-10 00:43:17,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=422, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2025-01-10 00:43:17,380 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 25 predicate places. [2025-01-10 00:43:17,380 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 422 flow [2025-01-10 00:43:17,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:17,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:17,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:17,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:43:17,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:17,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:17,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1141603971, now seen corresponding path program 5 times [2025-01-10 00:43:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:17,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203166734] [2025-01-10 00:43:17,582 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:43:17,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:17,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:17,585 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:17,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 00:43:17,643 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:43:17,660 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:43:17,661 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:43:17,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:17,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:43:17,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:17,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:17,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:17,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203166734] [2025-01-10 00:43:17,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203166734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:17,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:17,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:43:17,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174678893] [2025-01-10 00:43:17,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:17,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:43:17,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:17,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:43:17,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:43:17,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 00:43:17,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 422 flow. Second operand has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:17,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:17,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 00:43:17,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:18,893 INFO L124 PetriNetUnfolderBase]: 9048/13921 cut-off events. [2025-01-10 00:43:18,894 INFO L125 PetriNetUnfolderBase]: For 10495/10793 co-relation queries the response was YES. [2025-01-10 00:43:18,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37151 conditions, 13921 events. 9048/13921 cut-off events. For 10495/10793 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 92901 event pairs, 1836 based on Foata normal form. 92/13863 useless extension candidates. Maximal degree in co-relation 37128. Up to 7307 conditions per place. [2025-01-10 00:43:18,977 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 72 selfloop transitions, 23 changer transitions 59/171 dead transitions. [2025-01-10 00:43:18,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 171 transitions, 1069 flow [2025-01-10 00:43:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:43:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:43:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 285 transitions. [2025-01-10 00:43:18,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-01-10 00:43:18,987 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 422 flow. Second operand 9 states and 285 transitions. [2025-01-10 00:43:18,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 171 transitions, 1069 flow [2025-01-10 00:43:19,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 171 transitions, 1051 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:43:19,004 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 483 flow [2025-01-10 00:43:19,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=483, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2025-01-10 00:43:19,007 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 31 predicate places. [2025-01-10 00:43:19,010 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 483 flow [2025-01-10 00:43:19,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:19,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:19,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:19,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 00:43:19,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:19,212 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:19,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1870386015, now seen corresponding path program 6 times [2025-01-10 00:43:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:19,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370422324] [2025-01-10 00:43:19,216 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:43:19,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:19,218 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:19,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 00:43:19,272 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:43:19,295 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:43:19,296 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 00:43:19,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:43:19,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:43:19,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:43:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:43:19,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:43:19,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:43:19,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370422324] [2025-01-10 00:43:19,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370422324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:43:19,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:43:19,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:43:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221532085] [2025-01-10 00:43:19,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:43:19,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:43:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:43:19,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:43:19,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:43:19,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-10 00:43:19,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 483 flow. Second operand has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:19,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:43:19,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-10 00:43:19,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:43:20,620 INFO L124 PetriNetUnfolderBase]: 9235/14375 cut-off events. [2025-01-10 00:43:20,620 INFO L125 PetriNetUnfolderBase]: For 16388/16571 co-relation queries the response was YES. [2025-01-10 00:43:20,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38936 conditions, 14375 events. 9235/14375 cut-off events. For 16388/16571 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 97372 event pairs, 1488 based on Foata normal form. 96/14360 useless extension candidates. Maximal degree in co-relation 38910. Up to 6862 conditions per place. [2025-01-10 00:43:20,678 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 43 selfloop transitions, 11 changer transitions 107/177 dead transitions. [2025-01-10 00:43:20,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 177 transitions, 1162 flow [2025-01-10 00:43:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:43:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:43:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 289 transitions. [2025-01-10 00:43:20,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5838383838383838 [2025-01-10 00:43:20,680 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 483 flow. Second operand 9 states and 289 transitions. [2025-01-10 00:43:20,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 177 transitions, 1162 flow [2025-01-10 00:43:20,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 177 transitions, 1113 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-01-10 00:43:20,693 INFO L231 Difference]: Finished difference. Result has 95 places, 62 transitions, 326 flow [2025-01-10 00:43:20,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=326, PETRI_PLACES=95, PETRI_TRANSITIONS=62} [2025-01-10 00:43:20,693 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2025-01-10 00:43:20,694 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 62 transitions, 326 flow [2025-01-10 00:43:20,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:43:20,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:43:20,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:20,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 00:43:20,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:20,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:43:20,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:43:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash -969341031, now seen corresponding path program 7 times [2025-01-10 00:43:20,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:43:20,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794593815] [2025-01-10 00:43:20,896 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 00:43:20,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:20,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:43:20,899 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:43:20,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 00:43:20,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:43:20,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:43:20,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:20,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:43:20,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:43:21,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 00:43:21,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 00:43:21,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:43:21,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:43:21,073 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:43:21,076 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:43:21,077 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:43:21,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:43:21,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:43:21,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:43:21,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-01-10 00:43:21,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-01-10 00:43:21,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-10 00:43:21,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:43:21,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 00:43:21,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:43:21,280 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2025-01-10 00:43:21,351 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:43:21,351 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:43:21,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:43:21 BasicIcfg [2025-01-10 00:43:21,354 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:43:21,355 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:43:21,355 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:43:21,355 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:43:21,356 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:43:06" (3/4) ... [2025-01-10 00:43:21,357 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:43:21,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:43:21,358 INFO L158 Benchmark]: Toolchain (without parser) took 15818.34ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 89.7MB in the beginning and 702.1MB in the end (delta: -612.3MB). Peak memory consumption was 315.0MB. Max. memory is 16.1GB. [2025-01-10 00:43:21,358 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:43:21,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.91ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 65.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:43:21,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.16ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 62.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:43:21,358 INFO L158 Benchmark]: Boogie Preprocessor took 63.07ms. Allocated memory is still 117.4MB. Free memory was 62.9MB in the beginning and 59.5MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:43:21,358 INFO L158 Benchmark]: RCFGBuilder took 726.97ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 59.5MB in the beginning and 194.1MB in the end (delta: -134.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2025-01-10 00:43:21,359 INFO L158 Benchmark]: TraceAbstraction took 14619.07ms. Allocated memory was 234.9MB in the beginning and 1.0GB in the end (delta: 805.3MB). Free memory was 193.4MB in the beginning and 702.4MB in the end (delta: -508.9MB). Peak memory consumption was 291.3MB. Max. memory is 16.1GB. [2025-01-10 00:43:21,359 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 1.0GB. Free memory was 702.4MB in the beginning and 702.1MB in the end (delta: 295.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:43:21,360 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.18ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.91ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 65.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.16ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 62.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.07ms. Allocated memory is still 117.4MB. Free memory was 62.9MB in the beginning and 59.5MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 726.97ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 59.5MB in the beginning and 194.1MB in the end (delta: -134.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14619.07ms. Allocated memory was 234.9MB in the beginning and 1.0GB in the end (delta: 805.3MB). Free memory was 193.4MB in the beginning and 702.4MB in the end (delta: -508.9MB). Peak memory consumption was 291.3MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 1.0GB. Free memory was 702.4MB in the beginning and 702.1MB in the end (delta: 295.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, t326=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, t326=0, t327=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix013.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 876]: 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: 872]: 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: 874]: 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, 89 locations, 8 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: 14.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 430 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3200 IncrementalHoareTripleChecker+Invalid, 3236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 61 mSDtfsCounter, 3200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=11, InterpolantAutomatonStates: 83, 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.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 399 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 1759 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1547 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:43:21,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample