/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:06:00,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:06:00,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:06:00,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:06:00,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:06:00,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:06:00,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:06:00,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:06:00,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:06:00,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:06:00,764 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:06:00,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:06:00,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:06:00,765 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:06:00,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:06:00,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:06:00,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:06:00,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:06:00,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:06:00,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:06:00,766 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:06:00,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:06:00,767 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:06:00,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:06:00,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:06:00,768 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:06:00,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:06:00,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:06:00,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:06:00,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:06:00,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:06:00,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:06:00,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:06:00,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:06:00,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:06:00,770 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:06:01,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:06:01,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:06:01,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:06:01,039 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:06:01,040 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:06:01,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-08-26 12:06:01,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:06:02,144 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:06:02,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-08-26 12:06:02,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ec13501f/e147a0c9dd7444968854e8e53684f546/FLAGa197579fb [2023-08-26 12:06:02,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ec13501f/e147a0c9dd7444968854e8e53684f546 [2023-08-26 12:06:02,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:06:02,175 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:06:02,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:06:02,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:06:02,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:06:02,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9b6b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02, skipping insertion in model container [2023-08-26 12:06:02,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,211 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:06:02,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:06:02,435 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:06:02,459 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:06:02,460 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:06:02,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:06:02,537 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:06:02,537 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:06:02,542 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:06:02,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02 WrapperNode [2023-08-26 12:06:02,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:06:02,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:06:02,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:06:02,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:06:02,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,605 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2023-08-26 12:06:02,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:06:02,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:06:02,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:06:02,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:06:02,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:06:02,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:06:02,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:06:02,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:06:02,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (1/1) ... [2023-08-26 12:06:02,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:06:02,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:06:02,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:06:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:06:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:06:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:06:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:06:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:06:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:06:02,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:06:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:06:02,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:06:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:06:02,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:06:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 12:06:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 12:06:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:06:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:06:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:06:02,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:06:02,715 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:06:02,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:06:02,840 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:06:02,841 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:06:03,057 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:06:03,139 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:06:03,139 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:06:03,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:06:03 BoogieIcfgContainer [2023-08-26 12:06:03,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:06:03,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:06:03,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:06:03,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:06:03,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:06:02" (1/3) ... [2023-08-26 12:06:03,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d4fa7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:06:03, skipping insertion in model container [2023-08-26 12:06:03,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:06:02" (2/3) ... [2023-08-26 12:06:03,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d4fa7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:06:03, skipping insertion in model container [2023-08-26 12:06:03,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:06:03" (3/3) ... [2023-08-26 12:06:03,153 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2023-08-26 12:06:03,164 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:06:03,164 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 12:06:03,164 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:06:03,205 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:06:03,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 12:06:03,279 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 12:06:03,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:06:03,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:06:03,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 12:06:03,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 12:06:03,289 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:06:03,295 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 12:06:03,297 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 12:06:03,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 12:06:03,334 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 12:06:03,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:06:03,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:06:03,337 INFO L119 LiptonReduction]: Number of co-enabled transitions 3316 [2023-08-26 12:06:07,055 INFO L134 LiptonReduction]: Checked pairs total: 9022 [2023-08-26 12:06:07,055 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-26 12:06:07,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:06:07,069 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bddebf5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:06:07,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 12:06:07,070 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:06:07,070 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:06:07,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:06:07,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:07,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:06:07,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:07,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash 610, now seen corresponding path program 1 times [2023-08-26 12:06:07,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:07,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267484271] [2023-08-26 12:06:07,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:07,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:07,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267484271] [2023-08-26 12:06:07,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267484271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:07,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:07,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:06:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706616250] [2023-08-26 12:06:07,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:07,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:06:07,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:07,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:06:07,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:06:07,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 283 [2023-08-26 12:06:07,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:07,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:07,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 283 [2023-08-26 12:06:07,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:07,636 INFO L124 PetriNetUnfolderBase]: 4373/6089 cut-off events. [2023-08-26 12:06:07,636 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-26 12:06:07,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12175 conditions, 6089 events. 4373/6089 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 31369 event pairs, 4373 based on Foata normal form. 216/5554 useless extension candidates. Maximal degree in co-relation 12163. Up to 5983 conditions per place. [2023-08-26 12:06:07,665 INFO L140 encePairwiseOnDemand]: 274/283 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 12:06:07,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-26 12:06:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:06:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:06:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-26 12:06:07,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141342756183745 [2023-08-26 12:06:07,679 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-26 12:06:07,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-26 12:06:07,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:07,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-26 12:06:07,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:07,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:07,686 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:07,687 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 291 transitions. [2023-08-26 12:06:07,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-26 12:06:07,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:06:07,691 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 12:06:07,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 12:06:07,694 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 12:06:07,694 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 12:06:07,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:07,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:07,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:07,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:06:07,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:07,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash -312659106, now seen corresponding path program 1 times [2023-08-26 12:06:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:07,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742867164] [2023-08-26 12:06:07,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:07,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:07,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:07,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742867164] [2023-08-26 12:06:07,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742867164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:07,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:07,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:06:07,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014847376] [2023-08-26 12:06:07,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:07,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:06:07,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:07,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:06:07,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:06:07,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-26 12:06:07,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:07,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:07,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-26 12:06:07,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:08,329 INFO L124 PetriNetUnfolderBase]: 3632/5267 cut-off events. [2023-08-26 12:06:08,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:06:08,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10357 conditions, 5267 events. 3632/5267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29189 event pairs, 668 based on Foata normal form. 0/4894 useless extension candidates. Maximal degree in co-relation 10354. Up to 3973 conditions per place. [2023-08-26 12:06:08,351 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 32 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-08-26 12:06:08,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-08-26 12:06:08,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:06:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:06:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-26 12:06:08,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49469964664310956 [2023-08-26 12:06:08,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-26 12:06:08,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-26 12:06:08,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:08,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-26 12:06:08,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:08,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:08,361 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:08,361 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 420 transitions. [2023-08-26 12:06:08,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-08-26 12:06:08,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:06:08,364 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2023-08-26 12:06:08,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-26 12:06:08,365 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 12:06:08,365 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2023-08-26 12:06:08,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:08,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:08,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:08,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:06:08,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:08,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1359022523, now seen corresponding path program 1 times [2023-08-26 12:06:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124130445] [2023-08-26 12:06:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:09,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:09,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124130445] [2023-08-26 12:06:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124130445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:06:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019777880] [2023-08-26 12:06:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:09,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:06:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:09,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:06:09,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:06:09,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 283 [2023-08-26 12:06:09,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:09,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:09,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 283 [2023-08-26 12:06:09,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:10,133 INFO L124 PetriNetUnfolderBase]: 9959/13680 cut-off events. [2023-08-26 12:06:10,133 INFO L125 PetriNetUnfolderBase]: For 288/288 co-relation queries the response was YES. [2023-08-26 12:06:10,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27887 conditions, 13680 events. 9959/13680 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 67216 event pairs, 2087 based on Foata normal form. 640/14320 useless extension candidates. Maximal degree in co-relation 27883. Up to 7121 conditions per place. [2023-08-26 12:06:10,188 INFO L140 encePairwiseOnDemand]: 272/283 looper letters, 44 selfloop transitions, 9 changer transitions 38/91 dead transitions. [2023-08-26 12:06:10,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 91 transitions, 378 flow [2023-08-26 12:06:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:06:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:06:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-26 12:06:10,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326097930338213 [2023-08-26 12:06:10,191 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-26 12:06:10,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-26 12:06:10,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:10,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-26 12:06:10,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:10,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:10,196 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:10,196 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 7 states and 857 transitions. [2023-08-26 12:06:10,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 91 transitions, 378 flow [2023-08-26 12:06:10,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 91 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:06:10,201 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 148 flow [2023-08-26 12:06:10,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-26 12:06:10,202 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-26 12:06:10,203 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 148 flow [2023-08-26 12:06:10,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:10,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:10,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:10,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:06:10,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:10,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:10,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1388534977, now seen corresponding path program 1 times [2023-08-26 12:06:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:10,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868919593] [2023-08-26 12:06:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:10,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:10,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868919593] [2023-08-26 12:06:10,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868919593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:06:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219251728] [2023-08-26 12:06:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:10,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:06:10,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:10,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:06:10,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:06:10,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 283 [2023-08-26 12:06:10,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:10,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:10,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 283 [2023-08-26 12:06:10,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:12,009 INFO L124 PetriNetUnfolderBase]: 11247/15622 cut-off events. [2023-08-26 12:06:12,009 INFO L125 PetriNetUnfolderBase]: For 14200/14200 co-relation queries the response was YES. [2023-08-26 12:06:12,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45989 conditions, 15622 events. 11247/15622 cut-off events. For 14200/14200 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 81023 event pairs, 2753 based on Foata normal form. 620/16242 useless extension candidates. Maximal degree in co-relation 45980. Up to 6705 conditions per place. [2023-08-26 12:06:12,069 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 74 selfloop transitions, 21 changer transitions 51/146 dead transitions. [2023-08-26 12:06:12,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 146 transitions, 892 flow [2023-08-26 12:06:12,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:06:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:06:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1225 transitions. [2023-08-26 12:06:12,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43286219081272087 [2023-08-26 12:06:12,073 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1225 transitions. [2023-08-26 12:06:12,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1225 transitions. [2023-08-26 12:06:12,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:12,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1225 transitions. [2023-08-26 12:06:12,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.5) internal successors, (1225), 10 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:12,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:12,080 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:12,080 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 148 flow. Second operand 10 states and 1225 transitions. [2023-08-26 12:06:12,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 146 transitions, 892 flow [2023-08-26 12:06:12,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 146 transitions, 879 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 12:06:12,203 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 356 flow [2023-08-26 12:06:12,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=356, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-08-26 12:06:12,204 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-26 12:06:12,204 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 356 flow [2023-08-26 12:06:12,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:12,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:12,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:12,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:06:12,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:12,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1822748446, now seen corresponding path program 1 times [2023-08-26 12:06:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:12,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519273519] [2023-08-26 12:06:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:12,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:12,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519273519] [2023-08-26 12:06:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519273519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:12,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:06:12,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316211419] [2023-08-26 12:06:12,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:12,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:06:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:06:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:06:12,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 283 [2023-08-26 12:06:12,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:12,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:12,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 283 [2023-08-26 12:06:12,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:13,395 INFO L124 PetriNetUnfolderBase]: 7481/10988 cut-off events. [2023-08-26 12:06:13,395 INFO L125 PetriNetUnfolderBase]: For 30895/31197 co-relation queries the response was YES. [2023-08-26 12:06:13,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42684 conditions, 10988 events. 7481/10988 cut-off events. For 30895/31197 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 62253 event pairs, 2086 based on Foata normal form. 424/11209 useless extension candidates. Maximal degree in co-relation 42667. Up to 7248 conditions per place. [2023-08-26 12:06:13,519 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 57 selfloop transitions, 12 changer transitions 19/100 dead transitions. [2023-08-26 12:06:13,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 796 flow [2023-08-26 12:06:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:06:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:06:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2023-08-26 12:06:13,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575971731448763 [2023-08-26 12:06:13,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2023-08-26 12:06:13,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2023-08-26 12:06:13,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:13,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2023-08-26 12:06:13,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:13,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:13,526 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:13,526 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 356 flow. Second operand 6 states and 777 transitions. [2023-08-26 12:06:13,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 796 flow [2023-08-26 12:06:13,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 734 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-08-26 12:06:13,572 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 421 flow [2023-08-26 12:06:13,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2023-08-26 12:06:13,574 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-26 12:06:13,574 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 421 flow [2023-08-26 12:06:13,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:13,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:13,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:13,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:06:13,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:13,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1411400989, now seen corresponding path program 1 times [2023-08-26 12:06:13,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:13,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83394904] [2023-08-26 12:06:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:13,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:13,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83394904] [2023-08-26 12:06:13,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83394904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:13,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:13,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:06:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668162422] [2023-08-26 12:06:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:13,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:06:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:06:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:06:13,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 12:06:13,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:13,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:13,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 12:06:13,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:15,068 INFO L124 PetriNetUnfolderBase]: 8659/12507 cut-off events. [2023-08-26 12:06:15,069 INFO L125 PetriNetUnfolderBase]: For 35651/36497 co-relation queries the response was YES. [2023-08-26 12:06:15,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49743 conditions, 12507 events. 8659/12507 cut-off events. For 35651/36497 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 71120 event pairs, 4405 based on Foata normal form. 397/12604 useless extension candidates. Maximal degree in co-relation 49725. Up to 8764 conditions per place. [2023-08-26 12:06:15,131 INFO L140 encePairwiseOnDemand]: 275/283 looper letters, 59 selfloop transitions, 22 changer transitions 17/110 dead transitions. [2023-08-26 12:06:15,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 954 flow [2023-08-26 12:06:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:06:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:06:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 917 transitions. [2023-08-26 12:06:15,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4628975265017668 [2023-08-26 12:06:15,134 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 917 transitions. [2023-08-26 12:06:15,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 917 transitions. [2023-08-26 12:06:15,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:15,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 917 transitions. [2023-08-26 12:06:15,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:15,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:15,138 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:15,138 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 421 flow. Second operand 7 states and 917 transitions. [2023-08-26 12:06:15,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 954 flow [2023-08-26 12:06:15,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 110 transitions, 942 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 12:06:15,184 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 623 flow [2023-08-26 12:06:15,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=623, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2023-08-26 12:06:15,184 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-26 12:06:15,185 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 623 flow [2023-08-26 12:06:15,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:15,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:15,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:15,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:06:15,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:15,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash 522300147, now seen corresponding path program 2 times [2023-08-26 12:06:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:15,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617773334] [2023-08-26 12:06:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:15,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:15,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617773334] [2023-08-26 12:06:15,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617773334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:15,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:15,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:06:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903970674] [2023-08-26 12:06:15,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:15,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:06:15,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:15,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:06:15,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:06:15,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-26 12:06:15,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 623 flow. Second operand has 7 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:15,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:15,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-26 12:06:15,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:16,930 INFO L124 PetriNetUnfolderBase]: 8952/12944 cut-off events. [2023-08-26 12:06:16,931 INFO L125 PetriNetUnfolderBase]: For 53502/54499 co-relation queries the response was YES. [2023-08-26 12:06:16,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57744 conditions, 12944 events. 8952/12944 cut-off events. For 53502/54499 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 73778 event pairs, 1782 based on Foata normal form. 360/12979 useless extension candidates. Maximal degree in co-relation 57722. Up to 9364 conditions per place. [2023-08-26 12:06:17,002 INFO L140 encePairwiseOnDemand]: 275/283 looper letters, 76 selfloop transitions, 23 changer transitions 17/128 dead transitions. [2023-08-26 12:06:17,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 128 transitions, 1255 flow [2023-08-26 12:06:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:06:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:06:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2023-08-26 12:06:17,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507824331145886 [2023-08-26 12:06:17,005 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2023-08-26 12:06:17,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2023-08-26 12:06:17,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:17,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2023-08-26 12:06:17,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:17,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:17,009 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:17,010 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 623 flow. Second operand 7 states and 893 transitions. [2023-08-26 12:06:17,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 128 transitions, 1255 flow [2023-08-26 12:06:17,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 1204 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-08-26 12:06:17,244 INFO L231 Difference]: Finished difference. Result has 74 places, 86 transitions, 834 flow [2023-08-26 12:06:17,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=834, PETRI_PLACES=74, PETRI_TRANSITIONS=86} [2023-08-26 12:06:17,244 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-26 12:06:17,245 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 834 flow [2023-08-26 12:06:17,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:17,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:17,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:17,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:06:17,246 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:17,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1132080573, now seen corresponding path program 3 times [2023-08-26 12:06:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:17,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632733000] [2023-08-26 12:06:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632733000] [2023-08-26 12:06:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632733000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:17,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:17,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:06:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427942405] [2023-08-26 12:06:17,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:17,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:06:17,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:17,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:06:17,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:06:17,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 283 [2023-08-26 12:06:17,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 86 transitions, 834 flow. Second operand has 7 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:17,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:17,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 283 [2023-08-26 12:06:17,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:18,757 INFO L124 PetriNetUnfolderBase]: 8914/12903 cut-off events. [2023-08-26 12:06:18,757 INFO L125 PetriNetUnfolderBase]: For 66233/67240 co-relation queries the response was YES. [2023-08-26 12:06:18,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60999 conditions, 12903 events. 8914/12903 cut-off events. For 66233/67240 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 73814 event pairs, 1556 based on Foata normal form. 550/13164 useless extension candidates. Maximal degree in co-relation 60975. Up to 8259 conditions per place. [2023-08-26 12:06:18,829 INFO L140 encePairwiseOnDemand]: 275/283 looper letters, 69 selfloop transitions, 32 changer transitions 10/123 dead transitions. [2023-08-26 12:06:18,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 1263 flow [2023-08-26 12:06:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:06:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:06:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 911 transitions. [2023-08-26 12:06:18,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4598687531549722 [2023-08-26 12:06:18,834 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 911 transitions. [2023-08-26 12:06:18,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 911 transitions. [2023-08-26 12:06:18,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:18,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 911 transitions. [2023-08-26 12:06:18,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.14285714285714) internal successors, (911), 7 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:18,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:18,840 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:18,840 INFO L175 Difference]: Start difference. First operand has 74 places, 86 transitions, 834 flow. Second operand 7 states and 911 transitions. [2023-08-26 12:06:18,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 1263 flow [2023-08-26 12:06:18,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 123 transitions, 1237 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-26 12:06:18,944 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 880 flow [2023-08-26 12:06:18,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=880, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2023-08-26 12:06:18,946 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-08-26 12:06:18,946 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 880 flow [2023-08-26 12:06:18,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:18,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:18,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:18,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:06:18,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:18,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1687681549, now seen corresponding path program 4 times [2023-08-26 12:06:18,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:18,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829032896] [2023-08-26 12:06:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:19,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:19,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829032896] [2023-08-26 12:06:19,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829032896] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:19,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:19,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:06:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595227736] [2023-08-26 12:06:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:19,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:06:19,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:19,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:06:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:06:19,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 283 [2023-08-26 12:06:19,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 880 flow. Second operand has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:19,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:19,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 283 [2023-08-26 12:06:19,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:21,024 INFO L124 PetriNetUnfolderBase]: 11353/15956 cut-off events. [2023-08-26 12:06:21,024 INFO L125 PetriNetUnfolderBase]: For 73457/73457 co-relation queries the response was YES. [2023-08-26 12:06:21,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74583 conditions, 15956 events. 11353/15956 cut-off events. For 73457/73457 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 84733 event pairs, 724 based on Foata normal form. 330/16286 useless extension candidates. Maximal degree in co-relation 74558. Up to 9189 conditions per place. [2023-08-26 12:06:21,099 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 102 selfloop transitions, 69 changer transitions 32/203 dead transitions. [2023-08-26 12:06:21,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 203 transitions, 2182 flow [2023-08-26 12:06:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:06:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:06:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1208 transitions. [2023-08-26 12:06:21,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268551236749117 [2023-08-26 12:06:21,103 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1208 transitions. [2023-08-26 12:06:21,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1208 transitions. [2023-08-26 12:06:21,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:21,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1208 transitions. [2023-08-26 12:06:21,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.8) internal successors, (1208), 10 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:21,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:21,108 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:21,108 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 880 flow. Second operand 10 states and 1208 transitions. [2023-08-26 12:06:21,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 203 transitions, 2182 flow [2023-08-26 12:06:21,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 203 transitions, 2158 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 12:06:21,268 INFO L231 Difference]: Finished difference. Result has 91 places, 125 transitions, 1645 flow [2023-08-26 12:06:21,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1645, PETRI_PLACES=91, PETRI_TRANSITIONS=125} [2023-08-26 12:06:21,268 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2023-08-26 12:06:21,268 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 125 transitions, 1645 flow [2023-08-26 12:06:21,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:21,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:21,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:21,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:06:21,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:21,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -623672145, now seen corresponding path program 1 times [2023-08-26 12:06:21,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:21,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788105176] [2023-08-26 12:06:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788105176] [2023-08-26 12:06:21,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788105176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:21,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:21,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:06:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745890875] [2023-08-26 12:06:21,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:21,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:06:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:21,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:06:21,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:06:21,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 12:06:21,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 125 transitions, 1645 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:21,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:21,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 12:06:21,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:21,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][91], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 102#L822true, 155#true, 81#L853-3true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P0Thread1of1ForFork0InUse, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 103#P1EXITtrue, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 273#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 92#L793true, 287#true, 232#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), 162#true, Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 178#true]) [2023-08-26 12:06:21,953 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 12:06:21,953 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:21,953 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:21,953 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:21,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][106], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 114#L829true, Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 155#true, 81#L853-3true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P0Thread1of1ForFork0InUse, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 103#P1EXITtrue, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 273#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 287#true, 232#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), 162#true, Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 89#L786true, 178#true]) [2023-08-26 12:06:21,954 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 12:06:21,954 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:21,954 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:21,954 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:22,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([356] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_60 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_103 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_93 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_104 256) 0))))) (and (= v_~z$r_buff0_thd0~0_59 (ite .cse0 0 v_~z$r_buff0_thd0~0_60)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92) (= v_~z~0_59 (ite .cse2 v_~z$w_buff0~0_48 (ite .cse1 v_~z$w_buff1~0_51 v_~z~0_60))) (= v_~z$r_buff1_thd0~0_55 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_59 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_92 256) 0)))) 0 v_~z$r_buff1_thd0~0_56)) (= (ite .cse2 0 v_~z$w_buff0_used~0_104) v_~z$w_buff0_used~0_103)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_56, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_60} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_55, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_59} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0][105], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 102#L822true, 155#true, 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork2InUse, 124#L864true, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P0Thread1of1ForFork0InUse, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 103#P1EXITtrue, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, Black: 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 273#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 287#true, 232#true, 162#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 89#L786true, 178#true]) [2023-08-26 12:06:22,071 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,071 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,071 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,071 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][91], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 102#L822true, 155#true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), 90#L858true, P0Thread1of1ForFork0InUse, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 103#P1EXITtrue, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 273#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 92#L793true, 287#true, 232#true, 162#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 178#true]) [2023-08-26 12:06:22,072 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][106], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 114#L829true, Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 155#true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), 90#L858true, P0Thread1of1ForFork0InUse, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 103#P1EXITtrue, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 273#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 287#true, 232#true, 162#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 217#(= ~z$r_buff0_thd0~0 0), Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 89#L786true, 178#true]) [2023-08-26 12:06:22,072 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,322 INFO L124 PetriNetUnfolderBase]: 5535/8252 cut-off events. [2023-08-26 12:06:22,322 INFO L125 PetriNetUnfolderBase]: For 80786/82730 co-relation queries the response was YES. [2023-08-26 12:06:22,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47280 conditions, 8252 events. 5535/8252 cut-off events. For 80786/82730 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 48341 event pairs, 1277 based on Foata normal form. 809/8703 useless extension candidates. Maximal degree in co-relation 47249. Up to 6649 conditions per place. [2023-08-26 12:06:22,388 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 121 selfloop transitions, 5 changer transitions 3/160 dead transitions. [2023-08-26 12:06:22,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 160 transitions, 2331 flow [2023-08-26 12:06:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:06:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:06:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 12:06:22,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793875147232038 [2023-08-26 12:06:22,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 12:06:22,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 12:06:22,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:22,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 12:06:22,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:22,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:22,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:22,392 INFO L175 Difference]: Start difference. First operand has 91 places, 125 transitions, 1645 flow. Second operand 3 states and 407 transitions. [2023-08-26 12:06:22,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 160 transitions, 2331 flow [2023-08-26 12:06:22,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 160 transitions, 2286 flow, removed 22 selfloop flow, removed 2 redundant places. [2023-08-26 12:06:22,489 INFO L231 Difference]: Finished difference. Result has 89 places, 119 transitions, 1506 flow [2023-08-26 12:06:22,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1506, PETRI_PLACES=89, PETRI_TRANSITIONS=119} [2023-08-26 12:06:22,489 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2023-08-26 12:06:22,489 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 119 transitions, 1506 flow [2023-08-26 12:06:22,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:22,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:22,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:22,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:06:22,490 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:22,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1361338990, now seen corresponding path program 1 times [2023-08-26 12:06:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:22,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778401128] [2023-08-26 12:06:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:22,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:22,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778401128] [2023-08-26 12:06:22,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778401128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:22,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:22,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:06:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025937505] [2023-08-26 12:06:22,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:22,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:06:22,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:06:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:06:22,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 12:06:22,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 119 transitions, 1506 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:22,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:22,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 12:06:22,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:22,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][144], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 292#true, 102#L822true, 155#true, 81#L853-3true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P0Thread1of1ForFork0InUse, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 103#P1EXITtrue, Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 126#P0EXITtrue, 92#L793true, 232#true, 287#true, Black: 289#(= ~__unbuffered_cnt~0 0), Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), 162#true, Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 178#true]) [2023-08-26 12:06:22,913 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 12:06:22,913 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:22,913 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:22,913 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:22,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][159], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 114#L829true, Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 292#true, 155#true, 81#L853-3true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P0Thread1of1ForFork0InUse, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 103#P1EXITtrue, Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 126#P0EXITtrue, 232#true, 287#true, Black: 289#(= ~__unbuffered_cnt~0 0), Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), 162#true, Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 89#L786true, 178#true]) [2023-08-26 12:06:22,914 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 12:06:22,914 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:22,914 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:22,914 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:22,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([356] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_60 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_103 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_93 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_104 256) 0))))) (and (= v_~z$r_buff0_thd0~0_59 (ite .cse0 0 v_~z$r_buff0_thd0~0_60)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92) (= v_~z~0_59 (ite .cse2 v_~z$w_buff0~0_48 (ite .cse1 v_~z$w_buff1~0_51 v_~z~0_60))) (= v_~z$r_buff1_thd0~0_55 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_59 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_92 256) 0)))) 0 v_~z$r_buff1_thd0~0_56)) (= (ite .cse2 0 v_~z$w_buff0_used~0_104) v_~z$w_buff0_used~0_103)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_56, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_60} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_55, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_59} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0][160], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 292#true, 102#L822true, 155#true, 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork2InUse, 124#L864true, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P0Thread1of1ForFork0InUse, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 103#P1EXITtrue, Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), Black: 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 126#P0EXITtrue, 232#true, 287#true, Black: 289#(= ~__unbuffered_cnt~0 0), 162#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 89#L786true, 178#true]) [2023-08-26 12:06:22,951 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,951 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,951 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,951 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][144], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 292#true, 102#L822true, 155#true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P0Thread1of1ForFork0InUse, 90#L858true, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 103#P1EXITtrue, Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 92#L793true, 232#true, 287#true, Black: 289#(= ~__unbuffered_cnt~0 0), 162#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 178#true]) [2023-08-26 12:06:22,951 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,951 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,951 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,951 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][159], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 114#L829true, Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 292#true, 155#true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), P0Thread1of1ForFork0InUse, 90#L858true, Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 103#P1EXITtrue, Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 232#true, 287#true, Black: 289#(= ~__unbuffered_cnt~0 0), 162#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 89#L786true, 178#true]) [2023-08-26 12:06:22,952 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,952 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,952 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:22,952 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:06:23,054 INFO L124 PetriNetUnfolderBase]: 2735/4345 cut-off events. [2023-08-26 12:06:23,055 INFO L125 PetriNetUnfolderBase]: For 40274/41085 co-relation queries the response was YES. [2023-08-26 12:06:23,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26167 conditions, 4345 events. 2735/4345 cut-off events. For 40274/41085 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24747 event pairs, 401 based on Foata normal form. 640/4854 useless extension candidates. Maximal degree in co-relation 26136. Up to 2227 conditions per place. [2023-08-26 12:06:23,079 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 147 selfloop transitions, 9 changer transitions 7/194 dead transitions. [2023-08-26 12:06:23,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 194 transitions, 2796 flow [2023-08-26 12:06:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:06:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:06:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-26 12:06:23,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48056537102473496 [2023-08-26 12:06:23,080 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-26 12:06:23,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-26 12:06:23,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:23,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-26 12:06:23,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,083 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,083 INFO L175 Difference]: Start difference. First operand has 89 places, 119 transitions, 1506 flow. Second operand 4 states and 544 transitions. [2023-08-26 12:06:23,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 194 transitions, 2796 flow [2023-08-26 12:06:23,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 194 transitions, 2789 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 12:06:23,122 INFO L231 Difference]: Finished difference. Result has 92 places, 117 transitions, 1462 flow [2023-08-26 12:06:23,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1462, PETRI_PLACES=92, PETRI_TRANSITIONS=117} [2023-08-26 12:06:23,122 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2023-08-26 12:06:23,122 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 117 transitions, 1462 flow [2023-08-26 12:06:23,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:23,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:23,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:06:23,123 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:23,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 419047996, now seen corresponding path program 1 times [2023-08-26 12:06:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404760278] [2023-08-26 12:06:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:23,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404760278] [2023-08-26 12:06:23,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404760278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:23,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:23,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:06:23,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677820513] [2023-08-26 12:06:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:23,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:06:23,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:23,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:06:23,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:06:23,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 12:06:23,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 117 transitions, 1462 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:23,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 12:06:23,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:23,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][142], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 292#true, 302#(<= ~__unbuffered_cnt~0 2), 102#L822true, 155#true, 81#L853-3true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P0Thread1of1ForFork0InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, 103#P1EXITtrue, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 92#L793true, 232#true, Black: 289#(= ~__unbuffered_cnt~0 0), 162#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 295#(<= ~__unbuffered_cnt~0 1), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 178#true]) [2023-08-26 12:06:23,482 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 12:06:23,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:23,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:23,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:23,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][155], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 114#L829true, Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 292#true, 302#(<= ~__unbuffered_cnt~0 2), 155#true, 81#L853-3true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P0Thread1of1ForFork0InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 277#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, 103#P1EXITtrue, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), Black: 275#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 232#true, Black: 289#(= ~__unbuffered_cnt~0 0), 162#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), Black: 222#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff1_thd0~0)), Black: 295#(<= ~__unbuffered_cnt~0 1), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 89#L786true, 178#true]) [2023-08-26 12:06:23,482 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 12:06:23,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:23,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:23,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:23,531 INFO L124 PetriNetUnfolderBase]: 1820/2905 cut-off events. [2023-08-26 12:06:23,531 INFO L125 PetriNetUnfolderBase]: For 25962/26529 co-relation queries the response was YES. [2023-08-26 12:06:23,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18294 conditions, 2905 events. 1820/2905 cut-off events. For 25962/26529 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 15640 event pairs, 208 based on Foata normal form. 476/3282 useless extension candidates. Maximal degree in co-relation 18262. Up to 1077 conditions per place. [2023-08-26 12:06:23,548 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 144 selfloop transitions, 13 changer transitions 10/197 dead transitions. [2023-08-26 12:06:23,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 197 transitions, 2805 flow [2023-08-26 12:06:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:06:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:06:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-26 12:06:23,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47985865724381627 [2023-08-26 12:06:23,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-26 12:06:23,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-26 12:06:23,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:23,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-26 12:06:23,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,553 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,553 INFO L175 Difference]: Start difference. First operand has 92 places, 117 transitions, 1462 flow. Second operand 5 states and 679 transitions. [2023-08-26 12:06:23,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 197 transitions, 2805 flow [2023-08-26 12:06:23,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 197 transitions, 2667 flow, removed 21 selfloop flow, removed 7 redundant places. [2023-08-26 12:06:23,593 INFO L231 Difference]: Finished difference. Result has 90 places, 105 transitions, 1216 flow [2023-08-26 12:06:23,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1216, PETRI_PLACES=90, PETRI_TRANSITIONS=105} [2023-08-26 12:06:23,594 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 39 predicate places. [2023-08-26 12:06:23,594 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 105 transitions, 1216 flow [2023-08-26 12:06:23,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:23,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:23,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:06:23,595 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:23,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1938593046, now seen corresponding path program 1 times [2023-08-26 12:06:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:23,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475079961] [2023-08-26 12:06:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:23,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:23,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475079961] [2023-08-26 12:06:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475079961] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:23,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:23,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:06:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882741768] [2023-08-26 12:06:23,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:23,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:06:23,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:23,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:06:23,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:06:23,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 283 [2023-08-26 12:06:23,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 105 transitions, 1216 flow. Second operand has 9 states, 9 states have (on average 121.33333333333333) internal successors, (1092), 9 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:23,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:23,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 283 [2023-08-26 12:06:23,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:24,522 INFO L124 PetriNetUnfolderBase]: 3102/5024 cut-off events. [2023-08-26 12:06:24,522 INFO L125 PetriNetUnfolderBase]: For 38859/39335 co-relation queries the response was YES. [2023-08-26 12:06:24,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31375 conditions, 5024 events. 3102/5024 cut-off events. For 38859/39335 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29984 event pairs, 364 based on Foata normal form. 233/5138 useless extension candidates. Maximal degree in co-relation 31344. Up to 2442 conditions per place. [2023-08-26 12:06:24,551 INFO L140 encePairwiseOnDemand]: 275/283 looper letters, 155 selfloop transitions, 27 changer transitions 59/267 dead transitions. [2023-08-26 12:06:24,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 267 transitions, 3513 flow [2023-08-26 12:06:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:06:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:06:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1158 transitions. [2023-08-26 12:06:24,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4546525323910483 [2023-08-26 12:06:24,553 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1158 transitions. [2023-08-26 12:06:24,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1158 transitions. [2023-08-26 12:06:24,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:24,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1158 transitions. [2023-08-26 12:06:24,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.66666666666666) internal successors, (1158), 9 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:24,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:24,558 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:24,558 INFO L175 Difference]: Start difference. First operand has 90 places, 105 transitions, 1216 flow. Second operand 9 states and 1158 transitions. [2023-08-26 12:06:24,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 267 transitions, 3513 flow [2023-08-26 12:06:24,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 267 transitions, 3373 flow, removed 35 selfloop flow, removed 4 redundant places. [2023-08-26 12:06:24,652 INFO L231 Difference]: Finished difference. Result has 100 places, 128 transitions, 1696 flow [2023-08-26 12:06:24,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1696, PETRI_PLACES=100, PETRI_TRANSITIONS=128} [2023-08-26 12:06:24,653 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2023-08-26 12:06:24,653 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 128 transitions, 1696 flow [2023-08-26 12:06:24,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 121.33333333333333) internal successors, (1092), 9 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:24,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:24,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:24,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:06:24,653 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:24,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1459366490, now seen corresponding path program 2 times [2023-08-26 12:06:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:24,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312169746] [2023-08-26 12:06:24,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:24,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:24,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312169746] [2023-08-26 12:06:24,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312169746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:24,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:24,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:06:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731708618] [2023-08-26 12:06:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:24,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:06:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:06:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:06:24,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 12:06:24,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 128 transitions, 1696 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:24,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:24,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 12:06:24,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:25,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][193], [Black: 183#(or (not (= 2 ~x~0)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))), Black: 182#(not (= 2 ~x~0)), Black: 181#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), 308#(and (= ~z$r_buff0_thd0~0 0) (= ~b~0 1)), Black: 317#(and (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (= ~z$w_buff0_used~0 0)), Black: 180#(and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 186#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~x~0 ~z~0)), Black: 319#(and (not (= ~__unbuffered_p3_EBX~0 0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (= ~z$w_buff0_used~0 0)), Black: 309#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0)), 302#(<= ~__unbuffered_cnt~0 2), Black: 315#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 321#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0)), 102#L822true, 155#true, 81#L853-3true, P1Thread1of1ForFork2InUse, Black: 207#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P0Thread1of1ForFork0InUse, Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork1InUse, Black: 265#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 250#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 271#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, 103#P1EXITtrue, Black: 269#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), Black: 263#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)), 126#P0EXITtrue, 264#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 92#L793true, 333#(<= ~__unbuffered_cnt~0 2), 232#true, Black: 289#(= ~__unbuffered_cnt~0 0), 162#true, Black: 218#(and (<= 0 ~z$r_buff0_thd0~0) (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1)), Black: 295#(<= ~__unbuffered_cnt~0 1), Black: 170#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 164#(= ~__unbuffered_p3_EAX~0 0), 217#(= ~z$r_buff0_thd0~0 0), Black: 165#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 240#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 200#true, Black: 237#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 178#true]) [2023-08-26 12:06:25,086 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 12:06:25,086 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:25,086 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:25,086 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 12:06:25,144 INFO L124 PetriNetUnfolderBase]: 2266/3657 cut-off events. [2023-08-26 12:06:25,144 INFO L125 PetriNetUnfolderBase]: For 39309/40153 co-relation queries the response was YES. [2023-08-26 12:06:25,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23656 conditions, 3657 events. 2266/3657 cut-off events. For 39309/40153 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 21718 event pairs, 214 based on Foata normal form. 524/4059 useless extension candidates. Maximal degree in co-relation 23620. Up to 1379 conditions per place. [2023-08-26 12:06:25,165 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 135 selfloop transitions, 17 changer transitions 61/238 dead transitions. [2023-08-26 12:06:25,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 238 transitions, 3818 flow [2023-08-26 12:06:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:06:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:06:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-08-26 12:06:25,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717314487632509 [2023-08-26 12:06:25,167 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-08-26 12:06:25,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-08-26 12:06:25,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:25,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-08-26 12:06:25,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:25,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:25,171 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:25,171 INFO L175 Difference]: Start difference. First operand has 100 places, 128 transitions, 1696 flow. Second operand 6 states and 801 transitions. [2023-08-26 12:06:25,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 238 transitions, 3818 flow [2023-08-26 12:06:25,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 238 transitions, 3362 flow, removed 106 selfloop flow, removed 12 redundant places. [2023-08-26 12:06:25,277 INFO L231 Difference]: Finished difference. Result has 92 places, 96 transitions, 1122 flow [2023-08-26 12:06:25,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1122, PETRI_PLACES=92, PETRI_TRANSITIONS=96} [2023-08-26 12:06:25,277 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2023-08-26 12:06:25,278 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 96 transitions, 1122 flow [2023-08-26 12:06:25,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:25,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:25,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:25,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:06:25,278 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:25,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1566836061, now seen corresponding path program 1 times [2023-08-26 12:06:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256587569] [2023-08-26 12:06:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256587569] [2023-08-26 12:06:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256587569] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:25,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:06:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868034918] [2023-08-26 12:06:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:25,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:06:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:25,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:06:25,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:06:25,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 12:06:25,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 96 transitions, 1122 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:25,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:25,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 12:06:25,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:25,771 INFO L124 PetriNetUnfolderBase]: 1687/2747 cut-off events. [2023-08-26 12:06:25,771 INFO L125 PetriNetUnfolderBase]: For 20253/20526 co-relation queries the response was YES. [2023-08-26 12:06:25,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17308 conditions, 2747 events. 1687/2747 cut-off events. For 20253/20526 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15323 event pairs, 288 based on Foata normal form. 83/2770 useless extension candidates. Maximal degree in co-relation 17279. Up to 1452 conditions per place. [2023-08-26 12:06:25,786 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 67 selfloop transitions, 1 changer transitions 86/165 dead transitions. [2023-08-26 12:06:25,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 165 transitions, 2139 flow [2023-08-26 12:06:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:06:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:06:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-26 12:06:25,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678445229681979 [2023-08-26 12:06:25,788 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-26 12:06:25,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-26 12:06:25,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:25,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-26 12:06:25,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:25,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:25,791 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:25,791 INFO L175 Difference]: Start difference. First operand has 92 places, 96 transitions, 1122 flow. Second operand 5 states and 662 transitions. [2023-08-26 12:06:25,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 165 transitions, 2139 flow [2023-08-26 12:06:25,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 165 transitions, 1866 flow, removed 78 selfloop flow, removed 9 redundant places. [2023-08-26 12:06:25,830 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 619 flow [2023-08-26 12:06:25,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=619, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2023-08-26 12:06:25,831 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2023-08-26 12:06:25,831 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 619 flow [2023-08-26 12:06:25,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:25,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:25,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:25,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:06:25,831 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:25,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2004112723, now seen corresponding path program 2 times [2023-08-26 12:06:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:25,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226078340] [2023-08-26 12:06:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:26,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:26,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226078340] [2023-08-26 12:06:26,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226078340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:26,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:26,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:06:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131028042] [2023-08-26 12:06:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:26,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:06:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:06:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:06:26,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 283 [2023-08-26 12:06:26,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 619 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:26,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:26,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 283 [2023-08-26 12:06:26,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:26,745 INFO L124 PetriNetUnfolderBase]: 950/1558 cut-off events. [2023-08-26 12:06:26,745 INFO L125 PetriNetUnfolderBase]: For 8565/8565 co-relation queries the response was YES. [2023-08-26 12:06:26,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8215 conditions, 1558 events. 950/1558 cut-off events. For 8565/8565 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7451 event pairs, 141 based on Foata normal form. 1/1559 useless extension candidates. Maximal degree in co-relation 8188. Up to 791 conditions per place. [2023-08-26 12:06:26,751 INFO L140 encePairwiseOnDemand]: 273/283 looper letters, 54 selfloop transitions, 7 changer transitions 81/142 dead transitions. [2023-08-26 12:06:26,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 142 transitions, 1480 flow [2023-08-26 12:06:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:06:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:06:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2023-08-26 12:06:26,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4154467440686522 [2023-08-26 12:06:26,755 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2023-08-26 12:06:26,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2023-08-26 12:06:26,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:26,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2023-08-26 12:06:26,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:26,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:26,758 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:26,758 INFO L175 Difference]: Start difference. First operand has 88 places, 67 transitions, 619 flow. Second operand 7 states and 823 transitions. [2023-08-26 12:06:26,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 142 transitions, 1480 flow [2023-08-26 12:06:26,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 1342 flow, removed 37 selfloop flow, removed 14 redundant places. [2023-08-26 12:06:26,778 INFO L231 Difference]: Finished difference. Result has 79 places, 47 transitions, 348 flow [2023-08-26 12:06:26,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=79, PETRI_TRANSITIONS=47} [2023-08-26 12:06:26,778 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-26 12:06:26,779 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 47 transitions, 348 flow [2023-08-26 12:06:26,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:26,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:26,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:26,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:06:26,779 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:26,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1400265945, now seen corresponding path program 3 times [2023-08-26 12:06:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202972870] [2023-08-26 12:06:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:27,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:27,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202972870] [2023-08-26 12:06:27,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202972870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:27,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:27,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:06:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974411589] [2023-08-26 12:06:27,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:27,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:06:27,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:27,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:06:27,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:06:27,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 283 [2023-08-26 12:06:27,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 47 transitions, 348 flow. Second operand has 9 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:27,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:27,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 283 [2023-08-26 12:06:27,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:27,541 INFO L124 PetriNetUnfolderBase]: 343/637 cut-off events. [2023-08-26 12:06:27,541 INFO L125 PetriNetUnfolderBase]: For 2283/2289 co-relation queries the response was YES. [2023-08-26 12:06:27,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 637 events. 343/637 cut-off events. For 2283/2289 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2819 event pairs, 52 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 2920. Up to 243 conditions per place. [2023-08-26 12:06:27,544 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 43 selfloop transitions, 4 changer transitions 32/82 dead transitions. [2023-08-26 12:06:27,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 82 transitions, 712 flow [2023-08-26 12:06:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:06:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:06:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 980 transitions. [2023-08-26 12:06:27,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43286219081272087 [2023-08-26 12:06:27,547 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 980 transitions. [2023-08-26 12:06:27,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 980 transitions. [2023-08-26 12:06:27,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:27,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 980 transitions. [2023-08-26 12:06:27,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.5) internal successors, (980), 8 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:27,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:27,552 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:27,552 INFO L175 Difference]: Start difference. First operand has 79 places, 47 transitions, 348 flow. Second operand 8 states and 980 transitions. [2023-08-26 12:06:27,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 82 transitions, 712 flow [2023-08-26 12:06:27,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 630 flow, removed 16 selfloop flow, removed 12 redundant places. [2023-08-26 12:06:27,558 INFO L231 Difference]: Finished difference. Result has 71 places, 41 transitions, 239 flow [2023-08-26 12:06:27,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=239, PETRI_PLACES=71, PETRI_TRANSITIONS=41} [2023-08-26 12:06:27,559 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-26 12:06:27,559 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 41 transitions, 239 flow [2023-08-26 12:06:27,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:27,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:27,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:27,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:06:27,560 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:27,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1161781913, now seen corresponding path program 4 times [2023-08-26 12:06:27,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:27,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993119245] [2023-08-26 12:06:27,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:27,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:06:27,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:06:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:06:27,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:06:27,649 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:06:27,649 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 12:06:27,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 12:06:27,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 12:06:27,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 12:06:27,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 12:06:27,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 12:06:27,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:06:27,653 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:27,657 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:06:27,657 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:06:27,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:06:27 BasicIcfg [2023-08-26 12:06:27,721 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:06:27,722 INFO L158 Benchmark]: Toolchain (without parser) took 25546.18ms. Allocated memory was 356.5MB in the beginning and 5.6GB in the end (delta: 5.3GB). Free memory was 312.6MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2023-08-26 12:06:27,722 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 356.5MB. Free memory was 334.5MB in the beginning and 334.3MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:06:27,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.74ms. Allocated memory is still 356.5MB. Free memory was 312.6MB in the beginning and 289.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:06:27,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.62ms. Allocated memory is still 356.5MB. Free memory was 289.5MB in the beginning and 286.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:06:27,722 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 356.5MB. Free memory was 286.3MB in the beginning and 284.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:06:27,722 INFO L158 Benchmark]: RCFGBuilder took 497.16ms. Allocated memory is still 356.5MB. Free memory was 284.2MB in the beginning and 246.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 12:06:27,723 INFO L158 Benchmark]: TraceAbstraction took 24572.46ms. Allocated memory was 356.5MB in the beginning and 5.6GB in the end (delta: 5.3GB). Free memory was 246.5MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-08-26 12:06:27,723 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.11ms. Allocated memory is still 356.5MB. Free memory was 334.5MB in the beginning and 334.3MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 367.74ms. Allocated memory is still 356.5MB. Free memory was 312.6MB in the beginning and 289.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.62ms. Allocated memory is still 356.5MB. Free memory was 289.5MB in the beginning and 286.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 356.5MB. Free memory was 286.3MB in the beginning and 284.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 497.16ms. Allocated memory is still 356.5MB. Free memory was 284.2MB in the beginning and 246.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 24572.46ms. Allocated memory was 356.5MB in the beginning and 5.6GB in the end (delta: 5.3GB). Free memory was 246.5MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 148 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 39 TransitionsAfterwards, 3316 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 141 TotalNumberOfCompositions, 9022 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3451, independent: 3232, independent conditional: 0, independent unconditional: 3232, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1797, independent: 1760, independent conditional: 0, independent unconditional: 1760, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3451, independent: 1472, independent conditional: 0, independent unconditional: 1472, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1797, unknown conditional: 0, unknown unconditional: 1797] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-3, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=-2, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=-1, t1165={5:0}, t1166={6:0}, t1167={7: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] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 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) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 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 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 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 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix044.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 15 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: 24.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 665 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 665 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2570 IncrementalHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 54 mSDtfsCounter, 2570 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1696occurred in iteration=13, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 2467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:06:27,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...