./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:26:43,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:26:43,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:26:43,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:26:43,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:26:43,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:26:43,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:26:43,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:26:43,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:26:43,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:26:43,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:26:43,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:26:43,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:26:43,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:26:43,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:26:43,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:26:43,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:26:43,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:26:43,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:26:43,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:26:43,920 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:26:43,921 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:26:43,921 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:26:43,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:26:43,921 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:26:43,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:26:43,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:26:43,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:26:43,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:26:43,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:26:43,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:26:43,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:26:43,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:26:43,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:26:43,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:26:43,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:26:43,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:26:43,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:26:43,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:26:43,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:26:43,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:26:43,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:26:43,933 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 [2024-11-22 21:26:44,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:26:44,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:26:44,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:26:44,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:26:44,217 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:26:44,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-11-22 21:26:45,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:26:46,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:26:46,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-11-22 21:26:46,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/297a079f4/a276afb7ff7a43d48f992773fb3bd63e/FLAGb2d4968d4 [2024-11-22 21:26:46,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/297a079f4/a276afb7ff7a43d48f992773fb3bd63e [2024-11-22 21:26:46,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:26:46,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:26:46,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:26:46,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:26:46,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:26:46,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ff8f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46, skipping insertion in model container [2024-11-22 21:26:46,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:26:46,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:26:46,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:26:46,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:26:46,692 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:26:46,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46 WrapperNode [2024-11-22 21:26:46,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:26:46,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:26:46,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:26:46,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:26:46,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,751 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2024-11-22 21:26:46,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:26:46,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:26:46,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:26:46,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:26:46,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,796 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]. [2024-11-22 21:26:46,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:26:46,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:26:46,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:26:46,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:26:46,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (1/1) ... [2024-11-22 21:26:46,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:26:46,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:26:46,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:26:46,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:26:46,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:26:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:26:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:26:46,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:26:46,923 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:26:46,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:26:46,923 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:26:46,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:26:46,923 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-22 21:26:46,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-22 21:26:46,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:26:46,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:26:46,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:26:46,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:26:46,926 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:26:47,060 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:26:47,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:26:47,385 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:26:47,385 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:26:47,559 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:26:47,560 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:26:47,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:26:47 BoogieIcfgContainer [2024-11-22 21:26:47,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:26:47,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:26:47,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:26:47,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:26:47,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:26:46" (1/3) ... [2024-11-22 21:26:47,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22423dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:26:47, skipping insertion in model container [2024-11-22 21:26:47,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:46" (2/3) ... [2024-11-22 21:26:47,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22423dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:26:47, skipping insertion in model container [2024-11-22 21:26:47,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:26:47" (3/3) ... [2024-11-22 21:26:47,573 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2024-11-22 21:26:47,593 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:26:47,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:26:47,593 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:26:47,659 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:26:47,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-22 21:26:47,724 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-22 21:26:47,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:26:47,733 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 110 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. [2024-11-22 21:26:47,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-22 21:26:47,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-22 21:26:47,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:26:47,784 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;@20de147c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:26:47,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-22 21:26:47,798 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:26:47,799 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-22 21:26:47,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:26:47,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:26:47,800 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:26:47,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:26:47,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:26:47,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1547913968, now seen corresponding path program 1 times [2024-11-22 21:26:47,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:26:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108701969] [2024-11-22 21:26:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:26:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:26:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:26:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:26:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:26:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108701969] [2024-11-22 21:26:48,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108701969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:26:48,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:26:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:26:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890368124] [2024-11-22 21:26:48,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:26:48,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:26:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:26:48,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:26:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:26:48,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2024-11-22 21:26:48,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:48,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:26:48,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2024-11-22 21:26:48,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:26:48,956 INFO L124 PetriNetUnfolderBase]: 931/1851 cut-off events. [2024-11-22 21:26:48,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:26:48,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1851 events. 931/1851 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13952 event pairs, 199 based on Foata normal form. 96/1907 useless extension candidates. Maximal degree in co-relation 3235. Up to 1021 conditions per place. [2024-11-22 21:26:48,986 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-22 21:26:48,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 194 flow [2024-11-22 21:26:48,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:26:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:26:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-22 21:26:49,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-11-22 21:26:49,006 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 125 transitions. [2024-11-22 21:26:49,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 194 flow [2024-11-22 21:26:49,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:26:49,018 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-22 21:26:49,021 INFO L260 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} [2024-11-22 21:26:49,025 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-22 21:26:49,028 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-22 21:26:49,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:49,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:26:49,029 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:26:49,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:26:49,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:26:49,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:26:49,032 INFO L85 PathProgramCache]: Analyzing trace with hash 837422488, now seen corresponding path program 1 times [2024-11-22 21:26:49,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:26:49,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911994701] [2024-11-22 21:26:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:26:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:26:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:26:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:26:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:26:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911994701] [2024-11-22 21:26:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911994701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:26:49,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:26:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:26:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858843848] [2024-11-22 21:26:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:26:49,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:26:49,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:26:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:26:49,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:26:49,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-22 21:26:49,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:49,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:26:49,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-22 21:26:49,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:26:49,446 INFO L124 PetriNetUnfolderBase]: 815/1519 cut-off events. [2024-11-22 21:26:49,446 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-22 21:26:49,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1519 events. 815/1519 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11030 event pairs, 815 based on Foata normal form. 48/1491 useless extension candidates. Maximal degree in co-relation 2823. Up to 1188 conditions per place. [2024-11-22 21:26:49,457 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 19 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-22 21:26:49,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 144 flow [2024-11-22 21:26:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:26:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:26:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-22 21:26:49,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-22 21:26:49,462 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 106 transitions. [2024-11-22 21:26:49,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 144 flow [2024-11-22 21:26:49,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:26:49,466 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-11-22 21:26:49,467 INFO L260 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} [2024-11-22 21:26:49,467 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-11-22 21:26:49,468 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-11-22 21:26:49,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:49,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:26:49,468 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:26:49,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:26:49,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:26:49,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:26:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash 837423711, now seen corresponding path program 1 times [2024-11-22 21:26:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:26:49,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846519705] [2024-11-22 21:26:49,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:26:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:26:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:26:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:26:49,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:26:49,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846519705] [2024-11-22 21:26:49,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846519705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:26:49,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:26:49,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:26:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316711953] [2024-11-22 21:26:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:26:49,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:26:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:26:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:26:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:26:49,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-22 21:26:49,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:49,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:26:49,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-22 21:26:49,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:26:50,885 INFO L124 PetriNetUnfolderBase]: 4832/7640 cut-off events. [2024-11-22 21:26:50,886 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:26:50,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14409 conditions, 7640 events. 4832/7640 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 53017 event pairs, 2502 based on Foata normal form. 0/7449 useless extension candidates. Maximal degree in co-relation 14403. Up to 4354 conditions per place. [2024-11-22 21:26:50,930 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 34 selfloop transitions, 5 changer transitions 49/106 dead transitions. [2024-11-22 21:26:50,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 404 flow [2024-11-22 21:26:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:26:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:26:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 274 transitions. [2024-11-22 21:26:50,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-22 21:26:50,935 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 274 transitions. [2024-11-22 21:26:50,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 404 flow [2024-11-22 21:26:50,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 403 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:26:50,938 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 152 flow [2024-11-22 21:26:50,938 INFO L260 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=152, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2024-11-22 21:26:50,939 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-22 21:26:50,940 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 152 flow [2024-11-22 21:26:50,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:50,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:26:50,940 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:26:50,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:26:50,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:26:50,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:26:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash -447455969, now seen corresponding path program 1 times [2024-11-22 21:26:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:26:50,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043209098] [2024-11-22 21:26:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:26:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:26:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:26:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:26:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:26:51,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043209098] [2024-11-22 21:26:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043209098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:26:51,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:26:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:26:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754870031] [2024-11-22 21:26:51,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:26:51,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:26:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:26:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:26:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:26:51,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-22 21:26:51,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:51,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:26:51,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-22 21:26:51,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:26:52,073 INFO L124 PetriNetUnfolderBase]: 3470/5369 cut-off events. [2024-11-22 21:26:52,073 INFO L125 PetriNetUnfolderBase]: For 7300/7300 co-relation queries the response was YES. [2024-11-22 21:26:52,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15620 conditions, 5369 events. 3470/5369 cut-off events. For 7300/7300 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 34659 event pairs, 762 based on Foata normal form. 156/5450 useless extension candidates. Maximal degree in co-relation 15608. Up to 2836 conditions per place. [2024-11-22 21:26:52,123 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 35 selfloop transitions, 3 changer transitions 37/93 dead transitions. [2024-11-22 21:26:52,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 506 flow [2024-11-22 21:26:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:26:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:26:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2024-11-22 21:26:52,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6077922077922078 [2024-11-22 21:26:52,127 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 152 flow. Second operand 7 states and 234 transitions. [2024-11-22 21:26:52,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 506 flow [2024-11-22 21:26:52,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 493 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-22 21:26:52,155 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 162 flow [2024-11-22 21:26:52,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2024-11-22 21:26:52,156 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-11-22 21:26:52,156 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 162 flow [2024-11-22 21:26:52,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:52,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:26:52,157 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:26:52,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:26:52,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:26:52,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:26:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1351584668, now seen corresponding path program 1 times [2024-11-22 21:26:52,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:26:52,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152646965] [2024-11-22 21:26:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:26:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:26:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:26:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:26:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:26:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152646965] [2024-11-22 21:26:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152646965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:26:52,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:26:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:26:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740586312] [2024-11-22 21:26:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:26:52,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:26:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:26:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:26:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:26:52,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:26:52,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:52,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:26:52,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:26:52,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:26:53,798 INFO L124 PetriNetUnfolderBase]: 6879/10385 cut-off events. [2024-11-22 21:26:53,799 INFO L125 PetriNetUnfolderBase]: For 7331/7924 co-relation queries the response was YES. [2024-11-22 21:26:53,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25008 conditions, 10385 events. 6879/10385 cut-off events. For 7331/7924 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 71279 event pairs, 1271 based on Foata normal form. 355/10388 useless extension candidates. Maximal degree in co-relation 24992. Up to 5464 conditions per place. [2024-11-22 21:26:53,948 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 46 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-11-22 21:26:53,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 336 flow [2024-11-22 21:26:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:26:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:26:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-11-22 21:26:53,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-11-22 21:26:53,950 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 162 flow. Second operand 4 states and 149 transitions. [2024-11-22 21:26:53,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 336 flow [2024-11-22 21:26:54,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 322 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-22 21:26:54,119 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 194 flow [2024-11-22 21:26:54,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-11-22 21:26:54,120 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-11-22 21:26:54,120 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 194 flow [2024-11-22 21:26:54,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:54,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:26:54,121 INFO L204 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] [2024-11-22 21:26:54,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:26:54,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:26:54,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:26:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash 513539103, now seen corresponding path program 1 times [2024-11-22 21:26:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:26:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370276560] [2024-11-22 21:26:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:26:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:26:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:26:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:26:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:26:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370276560] [2024-11-22 21:26:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370276560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:26:54,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:26:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:26:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968410345] [2024-11-22 21:26:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:26:54,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:26:54,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:26:54,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:26:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:26:54,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:26:54,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:54,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:26:54,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:26:54,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:26:55,667 INFO L124 PetriNetUnfolderBase]: 6051/9253 cut-off events. [2024-11-22 21:26:55,668 INFO L125 PetriNetUnfolderBase]: For 7124/8254 co-relation queries the response was YES. [2024-11-22 21:26:55,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24992 conditions, 9253 events. 6051/9253 cut-off events. For 7124/8254 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 62431 event pairs, 712 based on Foata normal form. 350/9308 useless extension candidates. Maximal degree in co-relation 24978. Up to 3721 conditions per place. [2024-11-22 21:26:55,751 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 59 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2024-11-22 21:26:55,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 455 flow [2024-11-22 21:26:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:26:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:26:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2024-11-22 21:26:55,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-11-22 21:26:55,753 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 194 flow. Second operand 5 states and 190 transitions. [2024-11-22 21:26:55,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 455 flow [2024-11-22 21:26:55,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:26:55,757 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 259 flow [2024-11-22 21:26:55,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-11-22 21:26:55,760 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-11-22 21:26:55,760 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 259 flow [2024-11-22 21:26:55,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:55,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:26:55,761 INFO L204 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] [2024-11-22 21:26:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:26:55,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:26:55,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:26:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1891086994, now seen corresponding path program 1 times [2024-11-22 21:26:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:26:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134770547] [2024-11-22 21:26:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:26:55,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:26:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:26:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:26:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:26:56,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134770547] [2024-11-22 21:26:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134770547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:26:56,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:26:56,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:26:56,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725458278] [2024-11-22 21:26:56,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:26:56,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:26:56,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:26:56,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:26:56,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:26:56,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-22 21:26:56,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 259 flow. Second operand has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:56,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:26:56,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-22 21:26:56,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:26:58,064 INFO L124 PetriNetUnfolderBase]: 6670/11010 cut-off events. [2024-11-22 21:26:58,065 INFO L125 PetriNetUnfolderBase]: For 15130/17797 co-relation queries the response was YES. [2024-11-22 21:26:58,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32060 conditions, 11010 events. 6670/11010 cut-off events. For 15130/17797 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 81061 event pairs, 1681 based on Foata normal form. 192/10566 useless extension candidates. Maximal degree in co-relation 32043. Up to 7338 conditions per place. [2024-11-22 21:26:58,182 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 89 selfloop transitions, 42 changer transitions 4/162 dead transitions. [2024-11-22 21:26:58,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 162 transitions, 986 flow [2024-11-22 21:26:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:26:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-22 21:26:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 420 transitions. [2024-11-22 21:26:58,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5874125874125874 [2024-11-22 21:26:58,185 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 259 flow. Second operand 13 states and 420 transitions. [2024-11-22 21:26:58,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 162 transitions, 986 flow [2024-11-22 21:26:58,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 162 transitions, 971 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-22 21:26:58,193 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 635 flow [2024-11-22 21:26:58,193 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=635, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2024-11-22 21:26:58,194 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2024-11-22 21:26:58,194 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 635 flow [2024-11-22 21:26:58,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:58,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:26:58,195 INFO L204 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] [2024-11-22 21:26:58,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:26:58,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:26:58,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:26:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2084419650, now seen corresponding path program 2 times [2024-11-22 21:26:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:26:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391107063] [2024-11-22 21:26:58,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:26:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:26:58,229 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:26:58,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:26:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:26:58,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:26:58,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391107063] [2024-11-22 21:26:58,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391107063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:26:58,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:26:58,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:26:58,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150008138] [2024-11-22 21:26:58,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:26:58,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:26:58,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:26:58,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:26:58,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:26:58,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-22 21:26:58,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 635 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:26:58,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:26:58,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-22 21:26:58,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:00,635 INFO L124 PetriNetUnfolderBase]: 8490/14646 cut-off events. [2024-11-22 21:27:00,635 INFO L125 PetriNetUnfolderBase]: For 30231/32268 co-relation queries the response was YES. [2024-11-22 21:27:00,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47899 conditions, 14646 events. 8490/14646 cut-off events. For 30231/32268 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 121618 event pairs, 2559 based on Foata normal form. 242/13779 useless extension candidates. Maximal degree in co-relation 47874. Up to 5073 conditions per place. [2024-11-22 21:27:00,848 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 90 selfloop transitions, 7 changer transitions 15/154 dead transitions. [2024-11-22 21:27:00,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 154 transitions, 1131 flow [2024-11-22 21:27:00,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2024-11-22 21:27:00,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2024-11-22 21:27:00,851 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 635 flow. Second operand 6 states and 218 transitions. [2024-11-22 21:27:00,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 154 transitions, 1131 flow [2024-11-22 21:27:00,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 154 transitions, 1059 flow, removed 36 selfloop flow, removed 0 redundant places. [2024-11-22 21:27:00,938 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 532 flow [2024-11-22 21:27:00,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=532, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-11-22 21:27:00,939 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2024-11-22 21:27:00,939 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 532 flow [2024-11-22 21:27:00,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:00,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:00,940 INFO L204 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] [2024-11-22 21:27:00,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:27:00,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:00,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1265830576, now seen corresponding path program 3 times [2024-11-22 21:27:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695412145] [2024-11-22 21:27:00,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:27:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:01,078 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:27:01,078 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:01,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695412145] [2024-11-22 21:27:01,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695412145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:01,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:01,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:27:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769555564] [2024-11-22 21:27:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:01,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:01,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:01,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:01,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:01,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:01,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:01,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:01,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 42#L780true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,759 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,759 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,759 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,759 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,782 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-22 21:27:01,782 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 21:27:01,782 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 21:27:01,782 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 21:27:01,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,882 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,882 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,882 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,882 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,883 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,883 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,884 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,884 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,884 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,884 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [30#L868true, 42#L780true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,885 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,885 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,886 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,886 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 21:27:01,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,950 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,950 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,950 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,950 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,952 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 21:27:01,952 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:01,953 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:01,953 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:01,982 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,983 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,983 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,983 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,983 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,983 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [30#L868true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,984 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,984 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,984 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,984 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:01,985 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,985 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,986 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:01,986 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:02,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,059 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,059 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,059 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,059 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,083 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,083 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,083 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,083 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,085 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,085 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,085 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,085 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,085 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,085 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,087 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,087 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,087 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,087 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,088 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,089 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,089 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,089 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,090 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,090 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,090 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,090 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:02,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,153 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,153 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,153 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,153 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,174 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,174 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,174 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,174 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,174 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,174 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,176 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,176 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,176 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,176 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,177 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,177 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,177 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,177 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,178 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,178 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,178 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,178 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,181 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,181 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,181 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,181 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,181 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,182 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 58#P2EXITtrue, Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,184 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,184 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,185 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,185 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,185 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,186 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,186 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,186 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 21:27:02,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,243 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,243 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,243 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,243 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,273 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,273 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,274 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,274 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,274 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,274 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,276 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,276 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,276 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,277 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:02,277 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,277 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,277 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,278 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 21:27:02,672 INFO L124 PetriNetUnfolderBase]: 10277/15489 cut-off events. [2024-11-22 21:27:02,672 INFO L125 PetriNetUnfolderBase]: For 34125/38061 co-relation queries the response was YES. [2024-11-22 21:27:03,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52735 conditions, 15489 events. 10277/15489 cut-off events. For 34125/38061 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 107640 event pairs, 593 based on Foata normal form. 617/15359 useless extension candidates. Maximal degree in co-relation 52705. Up to 4865 conditions per place. [2024-11-22 21:27:03,063 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 98 selfloop transitions, 14 changer transitions 6/153 dead transitions. [2024-11-22 21:27:03,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 153 transitions, 1086 flow [2024-11-22 21:27:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-11-22 21:27:03,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.693939393939394 [2024-11-22 21:27:03,065 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 532 flow. Second operand 6 states and 229 transitions. [2024-11-22 21:27:03,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 153 transitions, 1086 flow [2024-11-22 21:27:03,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 153 transitions, 1069 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-22 21:27:03,106 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 572 flow [2024-11-22 21:27:03,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2024-11-22 21:27:03,107 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 32 predicate places. [2024-11-22 21:27:03,108 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 572 flow [2024-11-22 21:27:03,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:03,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:03,108 INFO L204 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] [2024-11-22 21:27:03,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:27:03,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:03,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1026574011, now seen corresponding path program 1 times [2024-11-22 21:27:03,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:03,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121120969] [2024-11-22 21:27:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:03,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:03,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121120969] [2024-11-22 21:27:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121120969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:03,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:03,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:27:03,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754566593] [2024-11-22 21:27:03,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:03,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:27:03,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:03,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:27:03,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:27:03,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-22 21:27:03,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 572 flow. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:03,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:03,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-22 21:27:03,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:06,650 INFO L124 PetriNetUnfolderBase]: 14232/23879 cut-off events. [2024-11-22 21:27:06,650 INFO L125 PetriNetUnfolderBase]: For 68131/73674 co-relation queries the response was YES. [2024-11-22 21:27:06,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84357 conditions, 23879 events. 14232/23879 cut-off events. For 68131/73674 co-relation queries the response was YES. Maximal size of possible extension queue 1446. Compared 198529 event pairs, 2094 based on Foata normal form. 623/22594 useless extension candidates. Maximal degree in co-relation 84327. Up to 8499 conditions per place. [2024-11-22 21:27:06,859 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 129 selfloop transitions, 68 changer transitions 33/264 dead transitions. [2024-11-22 21:27:06,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 264 transitions, 2093 flow [2024-11-22 21:27:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 21:27:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-22 21:27:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 493 transitions. [2024-11-22 21:27:06,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5975757575757575 [2024-11-22 21:27:06,861 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 572 flow. Second operand 15 states and 493 transitions. [2024-11-22 21:27:06,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 264 transitions, 2093 flow [2024-11-22 21:27:07,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 264 transitions, 2054 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-22 21:27:07,054 INFO L231 Difference]: Finished difference. Result has 114 places, 145 transitions, 1317 flow [2024-11-22 21:27:07,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1317, PETRI_PLACES=114, PETRI_TRANSITIONS=145} [2024-11-22 21:27:07,055 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 52 predicate places. [2024-11-22 21:27:07,055 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 145 transitions, 1317 flow [2024-11-22 21:27:07,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:07,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:07,056 INFO L204 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] [2024-11-22 21:27:07,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:27:07,056 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:07,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1726459289, now seen corresponding path program 2 times [2024-11-22 21:27:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:07,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373786763] [2024-11-22 21:27:07,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:27:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:07,077 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:27:07,078 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:07,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:07,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373786763] [2024-11-22 21:27:07,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373786763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:07,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:07,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:27:07,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266839134] [2024-11-22 21:27:07,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:07,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:27:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:07,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:27:07,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:27:07,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-22 21:27:07,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 145 transitions, 1317 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:07,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:07,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-22 21:27:07,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:11,691 INFO L124 PetriNetUnfolderBase]: 18118/30795 cut-off events. [2024-11-22 21:27:11,691 INFO L125 PetriNetUnfolderBase]: For 155572/160522 co-relation queries the response was YES. [2024-11-22 21:27:11,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124951 conditions, 30795 events. 18118/30795 cut-off events. For 155572/160522 co-relation queries the response was YES. Maximal size of possible extension queue 2009. Compared 274181 event pairs, 6425 based on Foata normal form. 747/28591 useless extension candidates. Maximal degree in co-relation 124911. Up to 12727 conditions per place. [2024-11-22 21:27:11,988 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 120 selfloop transitions, 31 changer transitions 56/241 dead transitions. [2024-11-22 21:27:11,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 241 transitions, 2488 flow [2024-11-22 21:27:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:27:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:27:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 281 transitions. [2024-11-22 21:27:11,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6386363636363637 [2024-11-22 21:27:11,991 INFO L175 Difference]: Start difference. First operand has 114 places, 145 transitions, 1317 flow. Second operand 8 states and 281 transitions. [2024-11-22 21:27:11,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 241 transitions, 2488 flow [2024-11-22 21:27:12,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 241 transitions, 2430 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-11-22 21:27:12,677 INFO L231 Difference]: Finished difference. Result has 116 places, 131 transitions, 1199 flow [2024-11-22 21:27:12,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1199, PETRI_PLACES=116, PETRI_TRANSITIONS=131} [2024-11-22 21:27:12,678 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 54 predicate places. [2024-11-22 21:27:12,678 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 131 transitions, 1199 flow [2024-11-22 21:27:12,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:12,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:12,679 INFO L204 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] [2024-11-22 21:27:12,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:27:12,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:12,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1565770763, now seen corresponding path program 3 times [2024-11-22 21:27:12,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:12,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343867429] [2024-11-22 21:27:12,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:27:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:12,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:27:12,723 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:12,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:12,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343867429] [2024-11-22 21:27:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343867429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:12,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053678542] [2024-11-22 21:27:12,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:12,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:27:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:27:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:27:12,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:12,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 131 transitions, 1199 flow. Second operand has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:12,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:12,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:12,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:15,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][167], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 56#L865-4true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 200#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1) (= ~z$w_buff0~0 0)), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 67#true, 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 210#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (not (= ~z$w_buff0~0 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 198#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff0~0 0)), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 206#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 226#(= ~x~0 1), Black: 202#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff0~0 ~x~0) (not (= ~z$w_buff0~0 0))), Black: 204#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (not (= ~x~0 0))), 256#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 193#(not (= ~x~0 0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), 10#L757true, 38#P1EXITtrue, Black: 235#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 240#(and (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 179#(< (mod ~main$tmp_guard0~0 256) 1), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:15,394 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 21:27:15,394 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:15,395 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:15,395 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 21:27:15,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][167], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 56#L865-4true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 200#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1) (= ~z$w_buff0~0 0)), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 67#true, 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 210#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 192#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (not (= ~z$w_buff0~0 0))), Black: 198#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff0~0 0)), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 206#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 226#(= ~x~0 1), Black: 202#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff0~0 ~x~0) (not (= ~z$w_buff0~0 0))), Black: 204#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (not (= ~x~0 0))), 256#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 193#(not (= ~x~0 0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), 10#L757true, 38#P1EXITtrue, Black: 235#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 240#(and (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 179#(< (mod ~main$tmp_guard0~0 256) 1), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-22 21:27:15,683 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 21:27:15,683 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:15,683 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:15,683 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 21:27:17,313 INFO L124 PetriNetUnfolderBase]: 23266/34760 cut-off events. [2024-11-22 21:27:17,313 INFO L125 PetriNetUnfolderBase]: For 145014/156128 co-relation queries the response was YES. [2024-11-22 21:27:17,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136867 conditions, 34760 events. 23266/34760 cut-off events. For 145014/156128 co-relation queries the response was YES. Maximal size of possible extension queue 2414. Compared 268599 event pairs, 1500 based on Foata normal form. 1607/34610 useless extension candidates. Maximal degree in co-relation 136825. Up to 13056 conditions per place. [2024-11-22 21:27:17,682 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 67 selfloop transitions, 18 changer transitions 115/226 dead transitions. [2024-11-22 21:27:17,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 226 transitions, 2256 flow [2024-11-22 21:27:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:27:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:27:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2024-11-22 21:27:17,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-11-22 21:27:17,684 INFO L175 Difference]: Start difference. First operand has 116 places, 131 transitions, 1199 flow. Second operand 7 states and 252 transitions. [2024-11-22 21:27:17,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 226 transitions, 2256 flow [2024-11-22 21:27:18,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 226 transitions, 2126 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-11-22 21:27:18,394 INFO L231 Difference]: Finished difference. Result has 114 places, 77 transitions, 574 flow [2024-11-22 21:27:18,394 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=114, PETRI_TRANSITIONS=77} [2024-11-22 21:27:18,395 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 52 predicate places. [2024-11-22 21:27:18,395 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 77 transitions, 574 flow [2024-11-22 21:27:18,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:18,396 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:18,396 INFO L204 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] [2024-11-22 21:27:18,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:27:18,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:18,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -121483124, now seen corresponding path program 1 times [2024-11-22 21:27:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:18,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878966591] [2024-11-22 21:27:18,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:18,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878966591] [2024-11-22 21:27:18,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878966591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:18,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:18,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880990658] [2024-11-22 21:27:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:18,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:18,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-22 21:27:18,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 77 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:18,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:18,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-22 21:27:18,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:20,132 INFO L124 PetriNetUnfolderBase]: 6761/12644 cut-off events. [2024-11-22 21:27:20,132 INFO L125 PetriNetUnfolderBase]: For 69524/71763 co-relation queries the response was YES. [2024-11-22 21:27:20,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48717 conditions, 12644 events. 6761/12644 cut-off events. For 69524/71763 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 113337 event pairs, 1606 based on Foata normal form. 140/11516 useless extension candidates. Maximal degree in co-relation 48679. Up to 4777 conditions per place. [2024-11-22 21:27:20,288 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 43 selfloop transitions, 8 changer transitions 37/123 dead transitions. [2024-11-22 21:27:20,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 123 transitions, 1046 flow [2024-11-22 21:27:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:27:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:27:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-11-22 21:27:20,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5688311688311688 [2024-11-22 21:27:20,290 INFO L175 Difference]: Start difference. First operand has 114 places, 77 transitions, 574 flow. Second operand 7 states and 219 transitions. [2024-11-22 21:27:20,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 123 transitions, 1046 flow [2024-11-22 21:27:20,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 123 transitions, 866 flow, removed 76 selfloop flow, removed 14 redundant places. [2024-11-22 21:27:20,662 INFO L231 Difference]: Finished difference. Result has 102 places, 69 transitions, 430 flow [2024-11-22 21:27:20,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=430, PETRI_PLACES=102, PETRI_TRANSITIONS=69} [2024-11-22 21:27:20,662 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 40 predicate places. [2024-11-22 21:27:20,663 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 69 transitions, 430 flow [2024-11-22 21:27:20,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:20,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:20,663 INFO L204 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] [2024-11-22 21:27:20,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:27:20,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:20,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash -832466578, now seen corresponding path program 2 times [2024-11-22 21:27:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:20,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776748317] [2024-11-22 21:27:20,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:27:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:20,686 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:27:20,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:20,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776748317] [2024-11-22 21:27:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776748317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:20,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:20,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027858205] [2024-11-22 21:27:20,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:20,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:20,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-22 21:27:20,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 69 transitions, 430 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:20,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:20,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-22 21:27:20,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:21,686 INFO L124 PetriNetUnfolderBase]: 4096/8307 cut-off events. [2024-11-22 21:27:21,686 INFO L125 PetriNetUnfolderBase]: For 17828/18474 co-relation queries the response was YES. [2024-11-22 21:27:21,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25391 conditions, 8307 events. 4096/8307 cut-off events. For 17828/18474 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 75862 event pairs, 680 based on Foata normal form. 76/7492 useless extension candidates. Maximal degree in co-relation 25359. Up to 2641 conditions per place. [2024-11-22 21:27:21,735 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 29/98 dead transitions. [2024-11-22 21:27:21,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 98 transitions, 658 flow [2024-11-22 21:27:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2024-11-22 21:27:21,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6121212121212121 [2024-11-22 21:27:21,736 INFO L175 Difference]: Start difference. First operand has 102 places, 69 transitions, 430 flow. Second operand 6 states and 202 transitions. [2024-11-22 21:27:21,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 98 transitions, 658 flow [2024-11-22 21:27:21,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 620 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-22 21:27:21,872 INFO L231 Difference]: Finished difference. Result has 97 places, 64 transitions, 365 flow [2024-11-22 21:27:21,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=97, PETRI_TRANSITIONS=64} [2024-11-22 21:27:21,873 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 35 predicate places. [2024-11-22 21:27:21,873 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 64 transitions, 365 flow [2024-11-22 21:27:21,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:21,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:21,873 INFO L204 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] [2024-11-22 21:27:21,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 21:27:21,874 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:21,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2137071574, now seen corresponding path program 3 times [2024-11-22 21:27:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:21,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611897539] [2024-11-22 21:27:21,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:27:21,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:21,916 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:27:21,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:22,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611897539] [2024-11-22 21:27:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611897539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:22,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:22,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:27:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993360447] [2024-11-22 21:27:22,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:22,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:27:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:27:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:27:22,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-11-22 21:27:22,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 64 transitions, 365 flow. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:22,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:22,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-11-22 21:27:22,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:23,234 INFO L124 PetriNetUnfolderBase]: 3428/6972 cut-off events. [2024-11-22 21:27:23,234 INFO L125 PetriNetUnfolderBase]: For 10688/11126 co-relation queries the response was YES. [2024-11-22 21:27:23,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19905 conditions, 6972 events. 3428/6972 cut-off events. For 10688/11126 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 62540 event pairs, 1220 based on Foata normal form. 45/6073 useless extension candidates. Maximal degree in co-relation 19876. Up to 2342 conditions per place. [2024-11-22 21:27:23,276 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 22 selfloop transitions, 3 changer transitions 28/92 dead transitions. [2024-11-22 21:27:23,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 547 flow [2024-11-22 21:27:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:27:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:27:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 268 transitions. [2024-11-22 21:27:23,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6090909090909091 [2024-11-22 21:27:23,278 INFO L175 Difference]: Start difference. First operand has 97 places, 64 transitions, 365 flow. Second operand 8 states and 268 transitions. [2024-11-22 21:27:23,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 92 transitions, 547 flow [2024-11-22 21:27:23,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 529 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-22 21:27:23,365 INFO L231 Difference]: Finished difference. Result has 98 places, 61 transitions, 342 flow [2024-11-22 21:27:23,365 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=342, PETRI_PLACES=98, PETRI_TRANSITIONS=61} [2024-11-22 21:27:23,365 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2024-11-22 21:27:23,366 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 61 transitions, 342 flow [2024-11-22 21:27:23,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:23,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:23,366 INFO L204 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] [2024-11-22 21:27:23,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 21:27:23,366 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:23,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1153093984, now seen corresponding path program 4 times [2024-11-22 21:27:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023719719] [2024-11-22 21:27:23,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:27:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:23,422 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:27:23,423 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:27:23,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:27:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:27:23,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:27:23,515 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:27:23,517 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-22 21:27:23,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-22 21:27:23,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-22 21:27:23,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-22 21:27:23,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-22 21:27:23,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-22 21:27:23,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-22 21:27:23,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-22 21:27:23,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 21:27:23,521 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:23,636 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:27:23,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:27:23,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:27:23 BasicIcfg [2024-11-22 21:27:23,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:27:23,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:27:23,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:27:23,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:27:23,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:26:47" (3/4) ... [2024-11-22 21:27:23,645 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:27:23,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:27:23,647 INFO L158 Benchmark]: Toolchain (without parser) took 37573.54ms. Allocated memory was 161.5MB in the beginning and 10.9GB in the end (delta: 10.7GB). Free memory was 91.2MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-22 21:27:23,647 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:27:23,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.54ms. Allocated memory is still 161.5MB. Free memory was 91.1MB in the beginning and 117.5MB in the end (delta: -26.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 21:27:23,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.65ms. Allocated memory is still 161.5MB. Free memory was 116.9MB in the beginning and 114.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:27:23,648 INFO L158 Benchmark]: Boogie Preprocessor took 72.86ms. Allocated memory is still 161.5MB. Free memory was 114.8MB in the beginning and 111.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:27:23,649 INFO L158 Benchmark]: RCFGBuilder took 731.77ms. Allocated memory is still 161.5MB. Free memory was 111.2MB in the beginning and 61.5MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-22 21:27:23,650 INFO L158 Benchmark]: TraceAbstraction took 36078.75ms. Allocated memory was 161.5MB in the beginning and 10.9GB in the end (delta: 10.7GB). Free memory was 60.9MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-22 21:27:23,650 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 10.9GB. Free memory is still 9.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:27:23,651 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.21ms. Allocated memory is still 100.7MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.54ms. Allocated memory is still 161.5MB. Free memory was 91.1MB in the beginning and 117.5MB in the end (delta: -26.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.65ms. Allocated memory is still 161.5MB. Free memory was 116.9MB in the beginning and 114.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.86ms. Allocated memory is still 161.5MB. Free memory was 114.8MB in the beginning and 111.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 731.77ms. Allocated memory is still 161.5MB. Free memory was 111.2MB in the beginning and 61.5MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 36078.75ms. Allocated memory was 161.5MB in the beginning and 10.9GB in the end (delta: 10.7GB). Free memory was 60.9MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 10.9GB. Free memory is still 9.3GB. 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_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 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; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=-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] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=-3, t950=-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] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=-3, t950=-2, t951=-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] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=-3, t950=-2, t951=-1, t952=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] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L827] 4 a = 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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=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 __unbuffered_p3_EAX = 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=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] [L833] 4 __unbuffered_p3_EBX = b 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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] [L756] 1 b = 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, 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] [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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, 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] [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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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 = y 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L786] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 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) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L836] 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) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 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 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 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=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L843] 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=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L779] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L807] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L867] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=-3, t950=-2, t951=-1, t952=0, weak$$choice0=1, 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] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 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 [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=-3, t950=-2, t951=-1, t952=0, weak$$choice0=1, 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] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=-3, t950=-2, t951=-1, t952=0, weak$$choice0=1, 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] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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", "mix036_pso.opt_tso.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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 35.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 932 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 885 mSDsluCounter, 386 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2498 IncrementalHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 84 mSDtfsCounter, 2498 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1317occurred in iteration=10, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 2512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:27:23,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:27:26,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:27:26,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:27:26,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:27:26,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:27:26,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:27:26,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:27:26,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:27:26,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:27:26,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:27:26,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:27:26,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:27:26,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:27:26,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:27:26,611 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:27:26,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:27:26,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:27:26,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:27:26,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:27:26,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:27:26,617 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:27:26,618 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:27:26,618 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:27:26,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:27:26,619 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:27:26,619 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:27:26,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:27:26,619 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:27:26,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:27:26,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:27:26,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:27:26,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:27:26,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:27:26,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:27:26,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:27:26,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:27:26,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:27:26,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:27:26,623 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:27:26,623 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:27:26,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:27:26,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:27:26,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:27:26,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:27:26,625 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 [2024-11-22 21:27:26,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:27:26,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:27:26,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:27:26,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:27:26,982 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:27:26,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-11-22 21:27:28,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:27:28,893 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:27:28,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-11-22 21:27:28,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b5a5b00/ba133100461f4f19825f4c007e690462/FLAGcfd0d59d2 [2024-11-22 21:27:28,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b5a5b00/ba133100461f4f19825f4c007e690462 [2024-11-22 21:27:28,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:27:28,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:27:28,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:27:28,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:27:28,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:27:28,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:27:28" (1/1) ... [2024-11-22 21:27:28,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1022c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:28, skipping insertion in model container [2024-11-22 21:27:28,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:27:28" (1/1) ... [2024-11-22 21:27:29,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:27:29,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:27:29,469 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:27:29,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:27:29,589 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:27:29,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29 WrapperNode [2024-11-22 21:27:29,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:27:29,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:27:29,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:27:29,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:27:29,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,671 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2024-11-22 21:27:29,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:27:29,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:27:29,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:27:29,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:27:29,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,722 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]. [2024-11-22 21:27:29,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:27:29,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:27:29,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:27:29,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:27:29,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (1/1) ... [2024-11-22 21:27:29,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:27:29,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:27:29,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:27:29,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:27:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:27:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:27:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:27:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:27:29,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:27:29,853 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:27:29,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:27:29,853 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:27:29,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:27:29,854 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-22 21:27:29,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-22 21:27:29,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:27:29,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:27:29,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:27:29,857 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:27:30,002 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:27:30,004 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:27:30,360 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:27:30,360 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:27:30,583 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:27:30,583 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:27:30,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:27:30 BoogieIcfgContainer [2024-11-22 21:27:30,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:27:30,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:27:30,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:27:30,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:27:30,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:27:28" (1/3) ... [2024-11-22 21:27:30,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5695152d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:27:30, skipping insertion in model container [2024-11-22 21:27:30,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:29" (2/3) ... [2024-11-22 21:27:30,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5695152d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:27:30, skipping insertion in model container [2024-11-22 21:27:30,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:27:30" (3/3) ... [2024-11-22 21:27:30,595 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2024-11-22 21:27:30,608 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:27:30,608 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:27:30,608 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:27:30,671 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:27:30,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-22 21:27:30,736 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-22 21:27:30,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:30,742 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 110 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. [2024-11-22 21:27:30,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-22 21:27:30,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-22 21:27:30,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:27:30,766 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;@2759a23f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:27:30,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-22 21:27:30,775 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:27:30,775 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-22 21:27:30,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:30,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:30,776 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:30,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:30,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:30,784 INFO L85 PathProgramCache]: Analyzing trace with hash -236054960, now seen corresponding path program 1 times [2024-11-22 21:27:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:30,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642451881] [2024-11-22 21:27:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:30,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:30,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:30,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:30,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 21:27:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:30,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:27:30,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:30,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:30,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:30,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642451881] [2024-11-22 21:27:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642451881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:30,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:30,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:27:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323449366] [2024-11-22 21:27:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:30,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:27:31,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:27:31,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:27:31,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2024-11-22 21:27:31,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:31,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:31,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2024-11-22 21:27:31,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:31,491 INFO L124 PetriNetUnfolderBase]: 931/1851 cut-off events. [2024-11-22 21:27:31,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:31,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1851 events. 931/1851 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13952 event pairs, 199 based on Foata normal form. 96/1907 useless extension candidates. Maximal degree in co-relation 3235. Up to 1021 conditions per place. [2024-11-22 21:27:31,508 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-22 21:27:31,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 194 flow [2024-11-22 21:27:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:27:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:27:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-22 21:27:31,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-11-22 21:27:31,531 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 125 transitions. [2024-11-22 21:27:31,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 194 flow [2024-11-22 21:27:31,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:27:31,539 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-22 21:27:31,543 INFO L260 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} [2024-11-22 21:27:31,548 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-22 21:27:31,548 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-22 21:27:31,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:31,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:31,549 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:31,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 21:27:31,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:31,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:31,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:31,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1916275610, now seen corresponding path program 1 times [2024-11-22 21:27:31,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:31,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67031373] [2024-11-22 21:27:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:31,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:31,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:31,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:31,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 21:27:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:31,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:27:31,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:31,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:31,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67031373] [2024-11-22 21:27:31,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67031373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:31,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:31,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:27:31,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600214280] [2024-11-22 21:27:31,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:31,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:27:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:27:31,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:27:31,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:31,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:31,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:31,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:31,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:32,885 INFO L124 PetriNetUnfolderBase]: 4352/6922 cut-off events. [2024-11-22 21:27:32,887 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2024-11-22 21:27:32,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13369 conditions, 6922 events. 4352/6922 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 49598 event pairs, 536 based on Foata normal form. 180/7085 useless extension candidates. Maximal degree in co-relation 13359. Up to 4015 conditions per place. [2024-11-22 21:27:32,949 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 45 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2024-11-22 21:27:32,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 270 flow [2024-11-22 21:27:32,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:27:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:27:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-11-22 21:27:32,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2024-11-22 21:27:32,952 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 4 states and 150 transitions. [2024-11-22 21:27:32,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 270 flow [2024-11-22 21:27:32,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:27:32,958 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2024-11-22 21:27:32,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-22 21:27:32,959 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-11-22 21:27:32,959 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2024-11-22 21:27:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:32,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:32,960 INFO L204 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] [2024-11-22 21:27:32,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 21:27:33,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:33,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:33,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash 431395617, now seen corresponding path program 1 times [2024-11-22 21:27:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:33,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167801795] [2024-11-22 21:27:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:33,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:33,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:33,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:33,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 21:27:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:33,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:27:33,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:33,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:33,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:33,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167801795] [2024-11-22 21:27:33,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167801795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:33,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:33,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:27:33,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385914362] [2024-11-22 21:27:33,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:33,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:27:33,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:33,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:27:33,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:27:33,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:33,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:33,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:33,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:33,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:34,101 INFO L124 PetriNetUnfolderBase]: 3648/5838 cut-off events. [2024-11-22 21:27:34,102 INFO L125 PetriNetUnfolderBase]: For 1511/1511 co-relation queries the response was YES. [2024-11-22 21:27:34,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13101 conditions, 5838 events. 3648/5838 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 40338 event pairs, 192 based on Foata normal form. 174/5997 useless extension candidates. Maximal degree in co-relation 13089. Up to 3097 conditions per place. [2024-11-22 21:27:34,149 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 57 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-11-22 21:27:34,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 383 flow [2024-11-22 21:27:34,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:27:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:27:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2024-11-22 21:27:34,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-11-22 21:27:34,152 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 142 flow. Second operand 5 states and 190 transitions. [2024-11-22 21:27:34,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 383 flow [2024-11-22 21:27:34,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 372 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:27:34,161 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 194 flow [2024-11-22 21:27:34,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-22 21:27:34,162 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-11-22 21:27:34,162 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 194 flow [2024-11-22 21:27:34,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:34,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:34,162 INFO L204 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] [2024-11-22 21:27:34,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 21:27:34,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:34,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:34,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1593207296, now seen corresponding path program 1 times [2024-11-22 21:27:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:34,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326932594] [2024-11-22 21:27:34,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:34,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:34,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:34,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:34,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 21:27:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:34,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:27:34,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:34,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:34,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326932594] [2024-11-22 21:27:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326932594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:34,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:27:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687978819] [2024-11-22 21:27:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:34,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:34,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:34,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:34,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:34,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:34,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:34,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:35,276 INFO L124 PetriNetUnfolderBase]: 2373/3781 cut-off events. [2024-11-22 21:27:35,277 INFO L125 PetriNetUnfolderBase]: For 2868/2868 co-relation queries the response was YES. [2024-11-22 21:27:35,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9591 conditions, 3781 events. 2373/3781 cut-off events. For 2868/2868 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 22854 event pairs, 69 based on Foata normal form. 140/3906 useless extension candidates. Maximal degree in co-relation 9577. Up to 1465 conditions per place. [2024-11-22 21:27:35,314 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 67 selfloop transitions, 14 changer transitions 1/102 dead transitions. [2024-11-22 21:27:35,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 502 flow [2024-11-22 21:27:35,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-11-22 21:27:35,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-11-22 21:27:35,317 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 194 flow. Second operand 6 states and 228 transitions. [2024-11-22 21:27:35,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 502 flow [2024-11-22 21:27:35,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 102 transitions, 472 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:27:35,328 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 244 flow [2024-11-22 21:27:35,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-11-22 21:27:35,329 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-22 21:27:35,329 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 244 flow [2024-11-22 21:27:35,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:35,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:35,330 INFO L204 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] [2024-11-22 21:27:35,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 21:27:35,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:35,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -518030225, now seen corresponding path program 1 times [2024-11-22 21:27:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:35,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839447909] [2024-11-22 21:27:35,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:35,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:35,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:35,542 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:35,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 21:27:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:35,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:27:35,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:35,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:35,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:35,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839447909] [2024-11-22 21:27:35,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839447909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:35,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:35,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890216047] [2024-11-22 21:27:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:35,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:27:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:35,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:27:35,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:27:35,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:35,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:35,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:35,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:35,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:36,246 INFO L124 PetriNetUnfolderBase]: 1385/2109 cut-off events. [2024-11-22 21:27:36,246 INFO L125 PetriNetUnfolderBase]: For 3118/3118 co-relation queries the response was YES. [2024-11-22 21:27:36,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6168 conditions, 2109 events. 1385/2109 cut-off events. For 3118/3118 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10323 event pairs, 39 based on Foata normal form. 72/2166 useless extension candidates. Maximal degree in co-relation 6153. Up to 668 conditions per place. [2024-11-22 21:27:36,262 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 61 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2024-11-22 21:27:36,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 504 flow [2024-11-22 21:27:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:27:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:27:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2024-11-22 21:27:36,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6493506493506493 [2024-11-22 21:27:36,264 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 244 flow. Second operand 7 states and 250 transitions. [2024-11-22 21:27:36,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 504 flow [2024-11-22 21:27:36,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 100 transitions, 458 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-22 21:27:36,277 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 254 flow [2024-11-22 21:27:36,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-11-22 21:27:36,278 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-11-22 21:27:36,278 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 254 flow [2024-11-22 21:27:36,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:36,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:36,279 INFO L204 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] [2024-11-22 21:27:36,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 21:27:36,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:36,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:36,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1717762119, now seen corresponding path program 1 times [2024-11-22 21:27:36,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:36,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489881538] [2024-11-22 21:27:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:36,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:36,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:36,486 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:36,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 21:27:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:36,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:27:36,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:36,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:36,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:36,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489881538] [2024-11-22 21:27:36,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489881538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:36,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:36,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:27:36,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544341516] [2024-11-22 21:27:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:36,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:27:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:36,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:27:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:27:36,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-22 21:27:36,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:36,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:36,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-22 21:27:36,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:36,776 INFO L124 PetriNetUnfolderBase]: 590/1133 cut-off events. [2024-11-22 21:27:36,776 INFO L125 PetriNetUnfolderBase]: For 472/497 co-relation queries the response was YES. [2024-11-22 21:27:36,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2467 conditions, 1133 events. 590/1133 cut-off events. For 472/497 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6488 event pairs, 552 based on Foata normal form. 16/987 useless extension candidates. Maximal degree in co-relation 2451. Up to 871 conditions per place. [2024-11-22 21:27:36,785 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 19 selfloop transitions, 1 changer transitions 1/57 dead transitions. [2024-11-22 21:27:36,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 294 flow [2024-11-22 21:27:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:27:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:27:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-22 21:27:36,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-22 21:27:36,787 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 254 flow. Second operand 3 states and 106 transitions. [2024-11-22 21:27:36,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 294 flow [2024-11-22 21:27:36,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 198 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-22 21:27:36,790 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 156 flow [2024-11-22 21:27:36,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-11-22 21:27:36,791 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-11-22 21:27:36,791 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 156 flow [2024-11-22 21:27:36,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:36,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:36,791 INFO L204 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] [2024-11-22 21:27:36,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 21:27:36,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:36,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:36,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1242035530, now seen corresponding path program 1 times [2024-11-22 21:27:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122916026] [2024-11-22 21:27:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:36,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:36,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:36,995 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:36,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 21:27:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:37,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:27:37,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:37,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:37,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122916026] [2024-11-22 21:27:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122916026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:37,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:37,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375057751] [2024-11-22 21:27:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:37,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:37,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:37,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-22 21:27:37,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:37,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:37,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-22 21:27:37,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:37,588 INFO L124 PetriNetUnfolderBase]: 1420/2513 cut-off events. [2024-11-22 21:27:37,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:37,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4907 conditions, 2513 events. 1420/2513 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14965 event pairs, 503 based on Foata normal form. 16/2361 useless extension candidates. Maximal degree in co-relation 4900. Up to 1048 conditions per place. [2024-11-22 21:27:37,602 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 28 selfloop transitions, 1 changer transitions 27/89 dead transitions. [2024-11-22 21:27:37,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 340 flow [2024-11-22 21:27:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-11-22 21:27:37,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2024-11-22 21:27:37,604 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 156 flow. Second operand 6 states and 213 transitions. [2024-11-22 21:27:37,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 340 flow [2024-11-22 21:27:37,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:27:37,606 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 166 flow [2024-11-22 21:27:37,607 INFO L260 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-11-22 21:27:37,607 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-11-22 21:27:37,607 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 166 flow [2024-11-22 21:27:37,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:37,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:37,608 INFO L204 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] [2024-11-22 21:27:37,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 21:27:37,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:37,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:37,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1194102544, now seen corresponding path program 2 times [2024-11-22 21:27:37,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:37,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161979245] [2024-11-22 21:27:37,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:27:37,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:37,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:37,811 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:37,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 21:27:37,906 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:27:37,906 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:37,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:27:37,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:37,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:37,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:37,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161979245] [2024-11-22 21:27:37,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161979245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:37,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:37,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:37,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466340443] [2024-11-22 21:27:37,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:37,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:37,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:37,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:37,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:37,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-22 21:27:37,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:37,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:37,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-22 21:27:37,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:38,436 INFO L124 PetriNetUnfolderBase]: 2019/3662 cut-off events. [2024-11-22 21:27:38,437 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 21:27:38,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7122 conditions, 3662 events. 2019/3662 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 24668 event pairs, 582 based on Foata normal form. 16/3390 useless extension candidates. Maximal degree in co-relation 7111. Up to 1289 conditions per place. [2024-11-22 21:27:38,464 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 45 selfloop transitions, 2 changer transitions 12/92 dead transitions. [2024-11-22 21:27:38,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 368 flow [2024-11-22 21:27:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-11-22 21:27:38,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-11-22 21:27:38,469 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 166 flow. Second operand 6 states and 216 transitions. [2024-11-22 21:27:38,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 368 flow [2024-11-22 21:27:38,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 357 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:27:38,473 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 176 flow [2024-11-22 21:27:38,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-11-22 21:27:38,474 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-11-22 21:27:38,474 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 176 flow [2024-11-22 21:27:38,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:38,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:38,474 INFO L204 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] [2024-11-22 21:27:38,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-22 21:27:38,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:38,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:38,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1893631670, now seen corresponding path program 3 times [2024-11-22 21:27:38,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:38,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756169956] [2024-11-22 21:27:38,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:27:38,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:38,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:38,680 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:38,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 21:27:38,773 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:27:38,773 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:38,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:27:38,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:38,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:38,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:38,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756169956] [2024-11-22 21:27:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756169956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:38,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:38,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970482972] [2024-11-22 21:27:38,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:38,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:38,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:38,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:38,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:38,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-22 21:27:38,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:38,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:38,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-22 21:27:38,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:39,548 INFO L124 PetriNetUnfolderBase]: 3414/6058 cut-off events. [2024-11-22 21:27:39,548 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-22 21:27:39,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11935 conditions, 6058 events. 3414/6058 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 45059 event pairs, 547 based on Foata normal form. 16/5523 useless extension candidates. Maximal degree in co-relation 11923. Up to 2126 conditions per place. [2024-11-22 21:27:39,579 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 40 selfloop transitions, 2 changer transitions 12/88 dead transitions. [2024-11-22 21:27:39,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 354 flow [2024-11-22 21:27:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-11-22 21:27:39,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6393939393939394 [2024-11-22 21:27:39,582 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 176 flow. Second operand 6 states and 211 transitions. [2024-11-22 21:27:39,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 354 flow [2024-11-22 21:27:39,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 88 transitions, 347 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-22 21:27:39,585 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 188 flow [2024-11-22 21:27:39,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-11-22 21:27:39,586 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2024-11-22 21:27:39,586 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 188 flow [2024-11-22 21:27:39,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:39,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:39,587 INFO L204 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] [2024-11-22 21:27:39,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 21:27:39,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:39,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash -284788624, now seen corresponding path program 4 times [2024-11-22 21:27:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:39,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755683217] [2024-11-22 21:27:39,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:27:39,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:39,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:39,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:39,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 21:27:39,888 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:27:39,888 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:39,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 21:27:39,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:40,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:40,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755683217] [2024-11-22 21:27:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755683217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:27:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387133312] [2024-11-22 21:27:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:40,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:27:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:40,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:27:40,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:27:40,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-22 21:27:40,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 30.428571428571427) internal successors, (213), 7 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:40,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:40,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-22 21:27:40,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:40,923 INFO L124 PetriNetUnfolderBase]: 4221/7757 cut-off events. [2024-11-22 21:27:40,923 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-11-22 21:27:40,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15145 conditions, 7757 events. 4221/7757 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 63003 event pairs, 1675 based on Foata normal form. 16/6846 useless extension candidates. Maximal degree in co-relation 15131. Up to 2605 conditions per place. [2024-11-22 21:27:40,979 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 34 selfloop transitions, 4 changer transitions 18/93 dead transitions. [2024-11-22 21:27:40,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 93 transitions, 376 flow [2024-11-22 21:27:40,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:27:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:27:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 281 transitions. [2024-11-22 21:27:40,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6386363636363637 [2024-11-22 21:27:40,982 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 188 flow. Second operand 8 states and 281 transitions. [2024-11-22 21:27:40,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 93 transitions, 376 flow [2024-11-22 21:27:40,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 369 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-22 21:27:40,986 INFO L231 Difference]: Finished difference. Result has 82 places, 61 transitions, 217 flow [2024-11-22 21:27:40,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=82, PETRI_TRANSITIONS=61} [2024-11-22 21:27:40,987 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 20 predicate places. [2024-11-22 21:27:40,987 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 61 transitions, 217 flow [2024-11-22 21:27:40,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.428571428571427) internal successors, (213), 7 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:40,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:40,988 INFO L204 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] [2024-11-22 21:27:40,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-22 21:27:41,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:41,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:41,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1344138940, now seen corresponding path program 5 times [2024-11-22 21:27:41,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:41,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283265703] [2024-11-22 21:27:41,189 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:27:41,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:41,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:41,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 21:27:41,313 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:27:41,313 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:27:41,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:27:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:27:41,467 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 21:27:41,467 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:27:41,468 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-22 21:27:41,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-22 21:27:41,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-22 21:27:41,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-22 21:27:41,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-22 21:27:41,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-22 21:27:41,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-22 21:27:41,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-22 21:27:41,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 21:27:41,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:41,675 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:41,790 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:27:41,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:27:41,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:27:41 BasicIcfg [2024-11-22 21:27:41,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:27:41,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:27:41,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:27:41,797 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:27:41,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:27:30" (3/4) ... [2024-11-22 21:27:41,800 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:27:41,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:27:41,802 INFO L158 Benchmark]: Toolchain (without parser) took 12864.05ms. Allocated memory was 71.3MB in the beginning and 901.8MB in the end (delta: 830.5MB). Free memory was 36.8MB in the beginning and 768.5MB in the end (delta: -731.7MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2024-11-22 21:27:41,802 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 52.4MB. Free memory is still 35.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:27:41,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 650.85ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 27.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 21:27:41,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.73ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 48.0MB in the end (delta: -20.4MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-11-22 21:27:41,803 INFO L158 Benchmark]: Boogie Preprocessor took 80.14ms. Allocated memory is still 71.3MB. Free memory was 48.0MB in the beginning and 44.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:27:41,803 INFO L158 Benchmark]: RCFGBuilder took 827.00ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 40.5MB in the end (delta: 4.3MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-11-22 21:27:41,803 INFO L158 Benchmark]: TraceAbstraction took 11208.75ms. Allocated memory was 86.0MB in the beginning and 901.8MB in the end (delta: 815.8MB). Free memory was 40.0MB in the beginning and 768.5MB in the end (delta: -728.5MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2024-11-22 21:27:41,804 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 901.8MB. Free memory is still 768.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:27:41,805 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 52.4MB. Free memory is still 35.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 650.85ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 27.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.73ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 48.0MB in the end (delta: -20.4MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.14ms. Allocated memory is still 71.3MB. Free memory was 48.0MB in the beginning and 44.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 827.00ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 40.5MB in the end (delta: 4.3MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11208.75ms. Allocated memory was 86.0MB in the beginning and 901.8MB in the end (delta: 815.8MB). Free memory was 40.0MB in the beginning and 768.5MB in the end (delta: -728.5MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 901.8MB. Free memory is still 768.5MB. 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_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 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; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=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] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=0, t950=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] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=0, t950=1, t951=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] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=0, t950=1, t951=2, t952=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] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L827] 4 a = 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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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 __unbuffered_p3_EAX = 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L833] 4 __unbuffered_p3_EBX = b 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L756] 1 b = 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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] [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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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] [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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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 = y 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L786] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 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) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L836] 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) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 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 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 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=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L807] 3 __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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L779] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L843] 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=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L867] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=0, t950=1, t951=2, t952=3, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 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 [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=0, t950=1, t951=2, t952=3, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=0, t950=1, t951=2, t952=3, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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", "mix036_pso.opt_tso.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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 11.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 484 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1609 IncrementalHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 14 mSDtfsCounter, 1609 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=5, InterpolantAutomatonStates: 54, 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.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 342 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 864 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1212 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:27:41,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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