/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 -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:04:02,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:04:02,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:04:02,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:04:02,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:04:02,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:04:02,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:04:02,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:04:02,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:04:02,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:04:02,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:04:02,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:04:02,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:04:02,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:04:02,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:04:02,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:04:02,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:04:02,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:04:02,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:04:02,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:04:02,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:04:02,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:04:02,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:04:02,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:04:02,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:04:02,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:04:02,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:04:02,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:04:02,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:04:02,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:04:02,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:04:02,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:04:02,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:04:02,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:04:02,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:04:02,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:04:02,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:04:02,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:04:02,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:04:02,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:04:02,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:04:02,115 INFO L101 SettingsManager]: Beginning 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-01-27 18:04:02,137 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:04:02,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:04:02,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:04:02,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:04:02,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:04:02,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:04:02,139 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:04:02,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:04:02,139 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:04:02,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:04:02,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:04:02,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:04:02,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:04:02,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:04:02,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:04:02,141 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:04:02,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:04:02,141 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:04:02,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:04:02,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:04:02,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:04:02,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:04:02,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:04:02,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:04:02,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:04:02,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:04:02,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:04:02,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:04:02,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:04:02,142 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:04:02,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:04:02,143 INFO L138 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 [2023-01-27 18:04:02,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:04:02,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:04:02,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:04:02,320 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:04:02,320 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:04:02,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-01-27 18:04:03,461 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:04:03,827 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:04:03,828 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-01-27 18:04:03,858 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0df7997/640d330920b54ae888fd50d5b1f86609/FLAG85bbdd79f [2023-01-27 18:04:03,888 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de0df7997/640d330920b54ae888fd50d5b1f86609 [2023-01-27 18:04:03,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:04:03,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:04:03,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:04:03,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:04:03,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:04:03,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:04:03" (1/1) ... [2023-01-27 18:04:03,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d126dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:03, skipping insertion in model container [2023-01-27 18:04:03,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:04:03" (1/1) ... [2023-01-27 18:04:03,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:04:03,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:04:04,244 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i[949,962] [2023-01-27 18:04:04,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:04:04,445 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:04:04,455 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i[949,962] [2023-01-27 18:04:04,491 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:04:04,509 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:04:04,509 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:04:04,514 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:04:04,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04 WrapperNode [2023-01-27 18:04:04,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:04:04,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:04:04,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:04:04,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:04:04,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,557 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-01-27 18:04:04,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:04:04,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:04:04,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:04:04,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:04:04,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,576 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:04:04,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:04:04,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:04:04,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:04:04,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (1/1) ... [2023-01-27 18:04:04,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:04:04,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:04:04,618 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-01-27 18:04:04,641 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-01-27 18:04:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:04:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:04:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:04:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:04:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:04:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:04:04,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:04:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:04:04,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:04:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:04:04,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:04:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:04:04,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:04:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:04:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:04:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:04:04,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:04:04,668 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:04:04,842 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:04:04,843 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:04:05,158 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:04:05,247 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:04:05,247 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:04:05,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:04:05 BoogieIcfgContainer [2023-01-27 18:04:05,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:04:05,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:04:05,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:04:05,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:04:05,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:04:03" (1/3) ... [2023-01-27 18:04:05,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36345766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:04:05, skipping insertion in model container [2023-01-27 18:04:05,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:04:04" (2/3) ... [2023-01-27 18:04:05,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36345766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:04:05, skipping insertion in model container [2023-01-27 18:04:05,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:04:05" (3/3) ... [2023-01-27 18:04:05,255 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-01-27 18:04:05,267 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:04:05,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:04:05,268 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:04:05,322 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:04:05,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-01-27 18:04:05,388 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-27 18:04:05,389 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:04:05,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-27 18:04:05,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-01-27 18:04:05,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-01-27 18:04:05,398 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:04:05,404 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-27 18:04:05,406 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-01-27 18:04:05,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-01-27 18:04:05,430 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-01-27 18:04:05,430 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:04:05,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-27 18:04:05,433 INFO L119 LiptonReduction]: Number of co-enabled transitions 3272 [2023-01-27 18:04:08,416 INFO L134 LiptonReduction]: Checked pairs total: 9891 [2023-01-27 18:04:08,416 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-01-27 18:04:08,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:04:08,451 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;@4a27a3d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:04:08,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:04:08,468 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-01-27 18:04:08,468 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:04:08,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:08,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:04:08,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:08,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash 530157842, now seen corresponding path program 1 times [2023-01-27 18:04:08,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308144105] [2023-01-27 18:04:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308144105] [2023-01-27 18:04:08,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308144105] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:08,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:04:08,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959674444] [2023-01-27 18:04:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:08,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:04:08,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:08,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:04:08,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:04:08,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 239 [2023-01-27 18:04:08,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:08,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:08,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 239 [2023-01-27 18:04:08,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:09,600 INFO L130 PetriNetUnfolder]: 4695/6585 cut-off events. [2023-01-27 18:04:09,600 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-01-27 18:04:09,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13161 conditions, 6585 events. 4695/6585 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34013 event pairs, 1757 based on Foata normal form. 0/6268 useless extension candidates. Maximal degree in co-relation 13149. Up to 5107 conditions per place. [2023-01-27 18:04:09,637 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 39 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-01-27 18:04:09,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 202 flow [2023-01-27 18:04:09,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:04:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:04:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-01-27 18:04:09,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5536959553695955 [2023-01-27 18:04:09,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-01-27 18:04:09,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-01-27 18:04:09,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:09,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-01-27 18:04:09,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:09,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:09,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:09,666 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 397 transitions. [2023-01-27 18:04:09,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 202 flow [2023-01-27 18:04:09,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:04:09,672 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 72 flow [2023-01-27 18:04:09,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-01-27 18:04:09,676 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-01-27 18:04:09,676 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 72 flow [2023-01-27 18:04:09,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:09,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:09,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:09,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:04:09,678 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:09,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2089934941, now seen corresponding path program 1 times [2023-01-27 18:04:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126174460] [2023-01-27 18:04:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126174460] [2023-01-27 18:04:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126174460] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:10,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:10,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:04:10,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911507154] [2023-01-27 18:04:10,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:10,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:04:10,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:04:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:04:10,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 239 [2023-01-27 18:04:10,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:10,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:10,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 239 [2023-01-27 18:04:10,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:11,586 INFO L130 PetriNetUnfolder]: 14899/20060 cut-off events. [2023-01-27 18:04:11,586 INFO L131 PetriNetUnfolder]: For 1027/1027 co-relation queries the response was YES. [2023-01-27 18:04:11,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41516 conditions, 20060 events. 14899/20060 cut-off events. For 1027/1027 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 96831 event pairs, 4059 based on Foata normal form. 900/20960 useless extension candidates. Maximal degree in co-relation 41506. Up to 12401 conditions per place. [2023-01-27 18:04:11,712 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 43 selfloop transitions, 2 changer transitions 32/77 dead transitions. [2023-01-27 18:04:11,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 326 flow [2023-01-27 18:04:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:04:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:04:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-01-27 18:04:11,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46778242677824267 [2023-01-27 18:04:11,714 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-01-27 18:04:11,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-01-27 18:04:11,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:11,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-01-27 18:04:11,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:11,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:11,719 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:11,719 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 5 states and 559 transitions. [2023-01-27 18:04:11,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 326 flow [2023-01-27 18:04:11,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 77 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:04:11,723 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 80 flow [2023-01-27 18:04:11,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-01-27 18:04:11,723 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-01-27 18:04:11,724 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 80 flow [2023-01-27 18:04:11,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:11,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:11,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:11,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:04:11,724 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:11,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1681534632, now seen corresponding path program 1 times [2023-01-27 18:04:11,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184502532] [2023-01-27 18:04:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184502532] [2023-01-27 18:04:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184502532] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:12,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:12,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:04:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791020649] [2023-01-27 18:04:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:12,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:04:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:12,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:04:12,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:04:12,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 239 [2023-01-27 18:04:12,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:12,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:12,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 239 [2023-01-27 18:04:12,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:13,451 INFO L130 PetriNetUnfolder]: 12729/17190 cut-off events. [2023-01-27 18:04:13,451 INFO L131 PetriNetUnfolder]: For 2700/2700 co-relation queries the response was YES. [2023-01-27 18:04:13,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37049 conditions, 17190 events. 12729/17190 cut-off events. For 2700/2700 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 83306 event pairs, 3239 based on Foata normal form. 600/17790 useless extension candidates. Maximal degree in co-relation 37036. Up to 11381 conditions per place. [2023-01-27 18:04:13,558 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 45 selfloop transitions, 2 changer transitions 28/75 dead transitions. [2023-01-27 18:04:13,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 327 flow [2023-01-27 18:04:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:04:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:04:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-01-27 18:04:13,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4661087866108787 [2023-01-27 18:04:13,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-01-27 18:04:13,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-01-27 18:04:13,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:13,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-01-27 18:04:13,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-01-27 18:04:13,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:13,564 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:13,564 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 80 flow. Second operand 5 states and 557 transitions. [2023-01-27 18:04:13,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 327 flow [2023-01-27 18:04:13,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 317 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:04:13,669 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 84 flow [2023-01-27 18:04:13,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-01-27 18:04:13,670 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-01-27 18:04:13,670 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 84 flow [2023-01-27 18:04:13,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:13,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:13,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:13,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:04:13,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:13,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1338019359, now seen corresponding path program 1 times [2023-01-27 18:04:13,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762026454] [2023-01-27 18:04:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:14,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:14,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762026454] [2023-01-27 18:04:14,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762026454] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:14,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:14,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:04:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111848044] [2023-01-27 18:04:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:14,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:04:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:14,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:04:14,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:04:14,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-01-27 18:04:14,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:14,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:14,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-01-27 18:04:14,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:14,531 INFO L130 PetriNetUnfolder]: 4410/6257 cut-off events. [2023-01-27 18:04:14,531 INFO L131 PetriNetUnfolder]: For 1259/1264 co-relation queries the response was YES. [2023-01-27 18:04:14,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13326 conditions, 6257 events. 4410/6257 cut-off events. For 1259/1264 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 31833 event pairs, 2290 based on Foata normal form. 182/6402 useless extension candidates. Maximal degree in co-relation 13312. Up to 5515 conditions per place. [2023-01-27 18:04:14,563 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 35 selfloop transitions, 5 changer transitions 17/62 dead transitions. [2023-01-27 18:04:14,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 272 flow [2023-01-27 18:04:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:04:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:04:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-01-27 18:04:14,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054393305439331 [2023-01-27 18:04:14,565 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-01-27 18:04:14,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-01-27 18:04:14,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:14,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-01-27 18:04:14,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:14,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:14,569 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:14,569 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 84 flow. Second operand 5 states and 604 transitions. [2023-01-27 18:04:14,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 272 flow [2023-01-27 18:04:14,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 264 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:04:14,582 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 121 flow [2023-01-27 18:04:14,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2023-01-27 18:04:14,582 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-01-27 18:04:14,582 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 121 flow [2023-01-27 18:04:14,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:14,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:14,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:14,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:04:14,583 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:14,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1490388582, now seen corresponding path program 1 times [2023-01-27 18:04:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:14,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563867561] [2023-01-27 18:04:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:14,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563867561] [2023-01-27 18:04:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563867561] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:04:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087128948] [2023-01-27 18:04:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:14,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:04:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:04:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:04:14,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 239 [2023-01-27 18:04:14,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:14,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:14,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 239 [2023-01-27 18:04:14,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:15,579 INFO L130 PetriNetUnfolder]: 4580/6562 cut-off events. [2023-01-27 18:04:15,580 INFO L131 PetriNetUnfolder]: For 4277/4589 co-relation queries the response was YES. [2023-01-27 18:04:15,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17297 conditions, 6562 events. 4580/6562 cut-off events. For 4277/4589 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 34271 event pairs, 2162 based on Foata normal form. 226/6747 useless extension candidates. Maximal degree in co-relation 17282. Up to 5089 conditions per place. [2023-01-27 18:04:15,612 INFO L137 encePairwiseOnDemand]: 231/239 looper letters, 52 selfloop transitions, 9 changer transitions 27/93 dead transitions. [2023-01-27 18:04:15,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 509 flow [2023-01-27 18:04:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:04:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:04:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-01-27 18:04:15,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4997011356843993 [2023-01-27 18:04:15,645 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-01-27 18:04:15,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-01-27 18:04:15,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:15,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-01-27 18:04:15,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:15,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:15,653 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:15,653 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 121 flow. Second operand 7 states and 836 transitions. [2023-01-27 18:04:15,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 509 flow [2023-01-27 18:04:15,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 502 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:04:15,661 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 203 flow [2023-01-27 18:04:15,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-01-27 18:04:15,663 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-01-27 18:04:15,663 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 203 flow [2023-01-27 18:04:15,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:15,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:15,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:15,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:04:15,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:15,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1450366638, now seen corresponding path program 1 times [2023-01-27 18:04:15,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:15,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612769795] [2023-01-27 18:04:15,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:15,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:16,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:16,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612769795] [2023-01-27 18:04:16,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612769795] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:16,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:16,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:04:16,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922268884] [2023-01-27 18:04:16,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:16,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:04:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:16,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:04:16,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:04:16,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 239 [2023-01-27 18:04:16,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 203 flow. Second operand has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:16,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:16,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 239 [2023-01-27 18:04:16,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:17,412 INFO L130 PetriNetUnfolder]: 13799/18652 cut-off events. [2023-01-27 18:04:17,412 INFO L131 PetriNetUnfolder]: For 27870/27870 co-relation queries the response was YES. [2023-01-27 18:04:17,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56926 conditions, 18652 events. 13799/18652 cut-off events. For 27870/27870 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 91380 event pairs, 3975 based on Foata normal form. 308/18960 useless extension candidates. Maximal degree in co-relation 56906. Up to 14818 conditions per place. [2023-01-27 18:04:17,491 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 67 selfloop transitions, 14 changer transitions 24/105 dead transitions. [2023-01-27 18:04:17,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 679 flow [2023-01-27 18:04:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:04:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:04:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 775 transitions. [2023-01-27 18:04:17,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4632396891811118 [2023-01-27 18:04:17,494 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 775 transitions. [2023-01-27 18:04:17,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 775 transitions. [2023-01-27 18:04:17,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:17,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 775 transitions. [2023-01-27 18:04:17,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:17,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:17,497 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:17,497 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 203 flow. Second operand 7 states and 775 transitions. [2023-01-27 18:04:17,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 679 flow [2023-01-27 18:04:17,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 647 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-01-27 18:04:17,625 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 305 flow [2023-01-27 18:04:17,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-01-27 18:04:17,627 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-01-27 18:04:17,627 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 305 flow [2023-01-27 18:04:17,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:17,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:17,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:17,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:04:17,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:17,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:17,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1627497542, now seen corresponding path program 1 times [2023-01-27 18:04:17,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:17,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742034860] [2023-01-27 18:04:17,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742034860] [2023-01-27 18:04:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742034860] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:04:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114928404] [2023-01-27 18:04:18,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:18,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:04:18,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:18,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:04:18,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:04:18,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 239 [2023-01-27 18:04:18,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:18,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:18,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 239 [2023-01-27 18:04:18,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:20,046 INFO L130 PetriNetUnfolder]: 14870/20101 cut-off events. [2023-01-27 18:04:20,046 INFO L131 PetriNetUnfolder]: For 46820/46820 co-relation queries the response was YES. [2023-01-27 18:04:20,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70398 conditions, 20101 events. 14870/20101 cut-off events. For 46820/46820 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 99806 event pairs, 3483 based on Foata normal form. 214/20315 useless extension candidates. Maximal degree in co-relation 70374. Up to 15825 conditions per place. [2023-01-27 18:04:20,135 INFO L137 encePairwiseOnDemand]: 225/239 looper letters, 100 selfloop transitions, 29 changer transitions 36/165 dead transitions. [2023-01-27 18:04:20,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 165 transitions, 1231 flow [2023-01-27 18:04:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:04:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:04:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1105 transitions. [2023-01-27 18:04:20,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46234309623430964 [2023-01-27 18:04:20,137 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1105 transitions. [2023-01-27 18:04:20,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1105 transitions. [2023-01-27 18:04:20,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:20,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1105 transitions. [2023-01-27 18:04:20,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:20,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:20,142 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:20,142 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 305 flow. Second operand 10 states and 1105 transitions. [2023-01-27 18:04:20,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 165 transitions, 1231 flow [2023-01-27 18:04:20,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 165 transitions, 1212 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-27 18:04:20,209 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 606 flow [2023-01-27 18:04:20,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=606, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2023-01-27 18:04:20,210 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-01-27 18:04:20,210 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 606 flow [2023-01-27 18:04:20,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:20,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:20,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:20,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:04:20,210 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:20,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1823243975, now seen corresponding path program 1 times [2023-01-27 18:04:20,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:20,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697690674] [2023-01-27 18:04:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:20,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:20,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697690674] [2023-01-27 18:04:20,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697690674] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:20,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:20,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:04:20,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952669897] [2023-01-27 18:04:20,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:20,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:04:20,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:04:20,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:04:20,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-01-27 18:04:20,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 606 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:20,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:20,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-01-27 18:04:20,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:21,596 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][29], [Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-01-27 18:04:21,597 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,598 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,598 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,598 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][112], [104#L876true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-01-27 18:04:21,598 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,598 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,598 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,598 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,672 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][29], [Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-01-27 18:04:21,672 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,672 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,672 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,672 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,672 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,713 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][112], [104#L876true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-01-27 18:04:21,714 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,714 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,714 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,714 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,714 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,767 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][29], [Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 121#L765true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-01-27 18:04:21,768 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][112], [Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-01-27 18:04:21,768 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,768 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:21,769 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:22,347 INFO L130 PetriNetUnfolder]: 16975/23863 cut-off events. [2023-01-27 18:04:22,347 INFO L131 PetriNetUnfolder]: For 139583/142416 co-relation queries the response was YES. [2023-01-27 18:04:22,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108337 conditions, 23863 events. 16975/23863 cut-off events. For 139583/142416 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 141448 event pairs, 3174 based on Foata normal form. 869/24238 useless extension candidates. Maximal degree in co-relation 108307. Up to 11336 conditions per place. [2023-01-27 18:04:22,535 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 107 selfloop transitions, 5 changer transitions 14/141 dead transitions. [2023-01-27 18:04:22,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 141 transitions, 1409 flow [2023-01-27 18:04:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:04:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:04:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-01-27 18:04:22,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121338912133891 [2023-01-27 18:04:22,537 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-01-27 18:04:22,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-01-27 18:04:22,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:22,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-01-27 18:04:22,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:22,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:22,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:22,540 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 606 flow. Second operand 5 states and 612 transitions. [2023-01-27 18:04:22,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 141 transitions, 1409 flow [2023-01-27 18:04:23,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 141 transitions, 1281 flow, removed 64 selfloop flow, removed 3 redundant places. [2023-01-27 18:04:23,159 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 591 flow [2023-01-27 18:04:23,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2023-01-27 18:04:23,160 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-01-27 18:04:23,160 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 591 flow [2023-01-27 18:04:23,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:23,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:23,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:23,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:04:23,161 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:23,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 240424201, now seen corresponding path program 2 times [2023-01-27 18:04:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:23,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156073865] [2023-01-27 18:04:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:23,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156073865] [2023-01-27 18:04:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156073865] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:23,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:23,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:04:23,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687453114] [2023-01-27 18:04:23,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:23,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:04:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:23,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:04:23,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:04:23,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-01-27 18:04:23,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 591 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:23,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:23,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-01-27 18:04:23,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:23,997 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][57], [Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-01-27 18:04:23,998 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:23,998 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:23,998 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:23,998 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:23,998 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][125], [Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-01-27 18:04:23,998 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:23,998 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:23,998 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:23,998 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:23,999 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][57], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:23,999 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,000 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,000 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,000 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,064 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][109], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 46#L828true, Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:24,065 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-01-27 18:04:24,065 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-01-27 18:04:24,065 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-01-27 18:04:24,065 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-01-27 18:04:24,103 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][130], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 107#P0EXITtrue, Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 46#L828true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:24,103 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,104 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,104 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,104 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,146 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][57], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:24,147 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,147 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,147 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,147 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,147 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:24,155 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:24,156 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,156 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][143], [Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-01-27 18:04:24,156 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,157 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][57], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:24,157 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,158 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,158 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,158 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,163 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][57], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:24,163 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,163 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,163 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,163 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,163 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:24,164 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][125], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-01-27 18:04:24,164 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][143], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-01-27 18:04:24,164 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:24,164 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:24,165 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:24,165 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:24,233 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:24,233 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,233 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,233 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,233 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,233 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,235 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-01-27 18:04:24,235 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,235 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,235 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,235 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:24,760 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:24,760 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-01-27 18:04:24,760 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-01-27 18:04:24,760 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-01-27 18:04:24,760 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-01-27 18:04:24,760 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-01-27 18:04:25,069 INFO L130 PetriNetUnfolder]: 12500/18354 cut-off events. [2023-01-27 18:04:25,069 INFO L131 PetriNetUnfolder]: For 116733/121250 co-relation queries the response was YES. [2023-01-27 18:04:25,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81577 conditions, 18354 events. 12500/18354 cut-off events. For 116733/121250 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 119276 event pairs, 3624 based on Foata normal form. 2552/20068 useless extension candidates. Maximal degree in co-relation 81546. Up to 10555 conditions per place. [2023-01-27 18:04:25,215 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 138 selfloop transitions, 10 changer transitions 0/172 dead transitions. [2023-01-27 18:04:25,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 172 transitions, 1584 flow [2023-01-27 18:04:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:04:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:04:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-01-27 18:04:25,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179916317991632 [2023-01-27 18:04:25,217 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-01-27 18:04:25,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-01-27 18:04:25,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:25,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-01-27 18:04:25,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:25,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:25,220 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:25,220 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 591 flow. Second operand 5 states and 619 transitions. [2023-01-27 18:04:25,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 172 transitions, 1584 flow [2023-01-27 18:04:25,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 172 transitions, 1562 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-27 18:04:25,289 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 627 flow [2023-01-27 18:04:25,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=627, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2023-01-27 18:04:25,290 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2023-01-27 18:04:25,290 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 627 flow [2023-01-27 18:04:25,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:25,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:25,290 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-01-27 18:04:25,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:04:25,291 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:25,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:25,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1982851672, now seen corresponding path program 1 times [2023-01-27 18:04:25,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:25,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723035899] [2023-01-27 18:04:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:25,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:25,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723035899] [2023-01-27 18:04:25,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723035899] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:25,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:25,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:04:25,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705595477] [2023-01-27 18:04:25,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:25,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:04:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:25,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:04:25,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:04:25,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-01-27 18:04:25,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 627 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:25,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:25,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-01-27 18:04:25,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:26,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][127], [Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-01-27 18:04:26,286 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,286 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,286 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,286 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,286 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][58], [Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), 95#L834true, Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-01-27 18:04:26,286 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,286 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,286 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,286 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,287 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][58], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,288 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,288 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,288 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,288 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,351 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][110], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, 46#L828true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,351 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-01-27 18:04:26,351 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-01-27 18:04:26,351 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-01-27 18:04:26,351 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-01-27 18:04:26,399 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][132], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 107#P0EXITtrue, Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 46#L828true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,399 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,399 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,399 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,399 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,449 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][58], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,449 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,449 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,449 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,450 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,450 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 18:04:26,458 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][148], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-01-27 18:04:26,458 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,458 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,458 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,458 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,459 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][129], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,459 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,459 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,459 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,459 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,460 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][58], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,460 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,461 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,461 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,461 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][148], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-01-27 18:04:26,465 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:26,465 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:26,465 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:26,465 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:26,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][127], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 66#L758true, P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-01-27 18:04:26,466 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,466 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,466 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,466 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][129], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,466 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:26,466 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:26,466 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:26,467 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:26,467 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][58], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,467 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,467 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,467 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,467 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,467 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,526 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][129], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,527 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,527 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,527 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,527 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,527 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][129], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), 95#L834true, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-01-27 18:04:26,529 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,529 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,530 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,530 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 18:04:26,897 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][129], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-01-27 18:04:26,897 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-01-27 18:04:26,897 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-01-27 18:04:26,897 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-01-27 18:04:26,897 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-01-27 18:04:26,898 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-01-27 18:04:27,167 INFO L130 PetriNetUnfolder]: 9367/14207 cut-off events. [2023-01-27 18:04:27,168 INFO L131 PetriNetUnfolder]: For 101343/106020 co-relation queries the response was YES. [2023-01-27 18:04:27,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70481 conditions, 14207 events. 9367/14207 cut-off events. For 101343/106020 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 94782 event pairs, 1300 based on Foata normal form. 2033/15619 useless extension candidates. Maximal degree in co-relation 70447. Up to 4868 conditions per place. [2023-01-27 18:04:27,309 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 177 selfloop transitions, 19 changer transitions 5/225 dead transitions. [2023-01-27 18:04:27,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 225 transitions, 2155 flow [2023-01-27 18:04:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:04:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:04:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-01-27 18:04:27,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188284518828452 [2023-01-27 18:04:27,312 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-01-27 18:04:27,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-01-27 18:04:27,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:27,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-01-27 18:04:27,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:27,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:27,317 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:27,317 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 627 flow. Second operand 7 states and 868 transitions. [2023-01-27 18:04:27,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 225 transitions, 2155 flow [2023-01-27 18:04:27,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 225 transitions, 2150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:04:27,426 INFO L231 Difference]: Finished difference. Result has 83 places, 89 transitions, 760 flow [2023-01-27 18:04:27,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=760, PETRI_PLACES=83, PETRI_TRANSITIONS=89} [2023-01-27 18:04:27,427 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2023-01-27 18:04:27,427 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 89 transitions, 760 flow [2023-01-27 18:04:27,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:27,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:27,428 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-01-27 18:04:27,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:04:27,428 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:27,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:27,428 INFO L85 PathProgramCache]: Analyzing trace with hash 194559498, now seen corresponding path program 1 times [2023-01-27 18:04:27,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:27,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503504391] [2023-01-27 18:04:27,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:27,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503504391] [2023-01-27 18:04:27,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503504391] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:27,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:27,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:04:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285093103] [2023-01-27 18:04:27,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:27,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:04:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:27,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:04:27,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:04:27,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 239 [2023-01-27 18:04:27,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 89 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:27,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:27,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 239 [2023-01-27 18:04:27,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:30,542 INFO L130 PetriNetUnfolder]: 20097/29039 cut-off events. [2023-01-27 18:04:30,542 INFO L131 PetriNetUnfolder]: For 174518/174518 co-relation queries the response was YES. [2023-01-27 18:04:30,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155606 conditions, 29039 events. 20097/29039 cut-off events. For 174518/174518 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 180892 event pairs, 1538 based on Foata normal form. 116/29155 useless extension candidates. Maximal degree in co-relation 155568. Up to 15505 conditions per place. [2023-01-27 18:04:30,816 INFO L137 encePairwiseOnDemand]: 230/239 looper letters, 142 selfloop transitions, 16 changer transitions 91/249 dead transitions. [2023-01-27 18:04:30,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 249 transitions, 2635 flow [2023-01-27 18:04:30,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:04:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:04:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 757 transitions. [2023-01-27 18:04:30,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.452480573819486 [2023-01-27 18:04:30,818 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 757 transitions. [2023-01-27 18:04:30,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 757 transitions. [2023-01-27 18:04:30,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:30,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 757 transitions. [2023-01-27 18:04:30,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:30,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:30,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:30,822 INFO L175 Difference]: Start difference. First operand has 83 places, 89 transitions, 760 flow. Second operand 7 states and 757 transitions. [2023-01-27 18:04:30,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 249 transitions, 2635 flow [2023-01-27 18:04:32,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 249 transitions, 2496 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-01-27 18:04:32,158 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 772 flow [2023-01-27 18:04:32,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=772, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2023-01-27 18:04:32,158 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2023-01-27 18:04:32,158 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 772 flow [2023-01-27 18:04:32,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:32,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:32,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:32,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:04:32,159 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:32,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1182482258, now seen corresponding path program 2 times [2023-01-27 18:04:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:32,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642393089] [2023-01-27 18:04:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:32,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:32,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642393089] [2023-01-27 18:04:32,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642393089] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:32,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:32,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:04:32,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102539053] [2023-01-27 18:04:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:32,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:04:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:32,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:04:32,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:04:32,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 239 [2023-01-27 18:04:32,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 772 flow. Second operand has 8 states, 8 states have (on average 106.5) internal successors, (852), 8 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:32,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:32,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 239 [2023-01-27 18:04:32,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:34,090 INFO L130 PetriNetUnfolder]: 7033/11351 cut-off events. [2023-01-27 18:04:34,090 INFO L131 PetriNetUnfolder]: For 83717/85184 co-relation queries the response was YES. [2023-01-27 18:04:34,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62270 conditions, 11351 events. 7033/11351 cut-off events. For 83717/85184 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 75065 event pairs, 2283 based on Foata normal form. 105/11085 useless extension candidates. Maximal degree in co-relation 62227. Up to 8896 conditions per place. [2023-01-27 18:04:34,195 INFO L137 encePairwiseOnDemand]: 233/239 looper letters, 98 selfloop transitions, 16 changer transitions 16/151 dead transitions. [2023-01-27 18:04:34,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 151 transitions, 1555 flow [2023-01-27 18:04:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:04:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:04:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 807 transitions. [2023-01-27 18:04:34,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823670053795577 [2023-01-27 18:04:34,197 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 807 transitions. [2023-01-27 18:04:34,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 807 transitions. [2023-01-27 18:04:34,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:34,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 807 transitions. [2023-01-27 18:04:34,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:34,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:34,202 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:34,202 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 772 flow. Second operand 7 states and 807 transitions. [2023-01-27 18:04:34,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 151 transitions, 1555 flow [2023-01-27 18:04:34,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 151 transitions, 1481 flow, removed 37 selfloop flow, removed 4 redundant places. [2023-01-27 18:04:34,515 INFO L231 Difference]: Finished difference. Result has 92 places, 90 transitions, 824 flow [2023-01-27 18:04:34,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=824, PETRI_PLACES=92, PETRI_TRANSITIONS=90} [2023-01-27 18:04:34,516 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2023-01-27 18:04:34,516 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 90 transitions, 824 flow [2023-01-27 18:04:34,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.5) internal successors, (852), 8 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:34,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:34,516 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-01-27 18:04:34,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:04:34,516 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:34,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash -326157241, now seen corresponding path program 1 times [2023-01-27 18:04:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:34,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11383733] [2023-01-27 18:04:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11383733] [2023-01-27 18:04:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11383733] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:34,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:34,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:04:34,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092811966] [2023-01-27 18:04:34,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:34,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:04:34,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:04:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:04:34,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 239 [2023-01-27 18:04:34,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 90 transitions, 824 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:34,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:34,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 239 [2023-01-27 18:04:34,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:36,883 INFO L130 PetriNetUnfolder]: 12883/19573 cut-off events. [2023-01-27 18:04:36,883 INFO L131 PetriNetUnfolder]: For 147159/147159 co-relation queries the response was YES. [2023-01-27 18:04:37,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108907 conditions, 19573 events. 12883/19573 cut-off events. For 147159/147159 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 124522 event pairs, 2784 based on Foata normal form. 145/19718 useless extension candidates. Maximal degree in co-relation 108862. Up to 11632 conditions per place. [2023-01-27 18:04:37,090 INFO L137 encePairwiseOnDemand]: 230/239 looper letters, 142 selfloop transitions, 19 changer transitions 61/222 dead transitions. [2023-01-27 18:04:37,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 222 transitions, 2425 flow [2023-01-27 18:04:37,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:04:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:04:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 766 transitions. [2023-01-27 18:04:37,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45786013150029886 [2023-01-27 18:04:37,092 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 766 transitions. [2023-01-27 18:04:37,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 766 transitions. [2023-01-27 18:04:37,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:37,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 766 transitions. [2023-01-27 18:04:37,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:37,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:37,096 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:37,096 INFO L175 Difference]: Start difference. First operand has 92 places, 90 transitions, 824 flow. Second operand 7 states and 766 transitions. [2023-01-27 18:04:37,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 222 transitions, 2425 flow [2023-01-27 18:04:37,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 222 transitions, 2351 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-01-27 18:04:37,399 INFO L231 Difference]: Finished difference. Result has 94 places, 94 transitions, 897 flow [2023-01-27 18:04:37,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=897, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2023-01-27 18:04:37,400 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places. [2023-01-27 18:04:37,400 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 897 flow [2023-01-27 18:04:37,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:37,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:37,401 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-01-27 18:04:37,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:04:37,401 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:37,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash -465539227, now seen corresponding path program 1 times [2023-01-27 18:04:37,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:37,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550113476] [2023-01-27 18:04:37,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:37,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:37,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:37,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550113476] [2023-01-27 18:04:37,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550113476] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:37,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:37,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:04:37,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573513870] [2023-01-27 18:04:37,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:37,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:04:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:04:37,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:04:37,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-01-27 18:04:37,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 897 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 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-01-27 18:04:37,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:37,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-01-27 18:04:37,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:38,522 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), 273#(<= ~__unbuffered_cnt~0 1), P1Thread1of1ForFork3InUse, Black: 323#(= ~a~0 1), Black: 332#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 21#L865-3true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, 330#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 83#P3EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 290#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 285#(= ~z~0 1), Black: 287#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true, 340#(<= ~__unbuffered_cnt~0 1), 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 307#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0))]) [2023-01-27 18:04:38,523 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-01-27 18:04:38,523 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:38,523 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:38,523 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 18:04:39,157 INFO L130 PetriNetUnfolder]: 7542/12158 cut-off events. [2023-01-27 18:04:39,158 INFO L131 PetriNetUnfolder]: For 108596/110587 co-relation queries the response was YES. [2023-01-27 18:04:39,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67080 conditions, 12158 events. 7542/12158 cut-off events. For 108596/110587 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 86769 event pairs, 782 based on Foata normal form. 1178/12988 useless extension candidates. Maximal degree in co-relation 67034. Up to 4451 conditions per place. [2023-01-27 18:04:39,228 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 138 selfloop transitions, 17 changer transitions 33/213 dead transitions. [2023-01-27 18:04:39,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 213 transitions, 2325 flow [2023-01-27 18:04:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:04:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:04:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-01-27 18:04:39,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194261805140467 [2023-01-27 18:04:39,230 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-01-27 18:04:39,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-01-27 18:04:39,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:39,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-01-27 18:04:39,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:39,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:39,234 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:39,234 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 897 flow. Second operand 7 states and 869 transitions. [2023-01-27 18:04:39,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 213 transitions, 2325 flow [2023-01-27 18:04:39,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 213 transitions, 2323 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 18:04:39,316 INFO L231 Difference]: Finished difference. Result has 101 places, 98 transitions, 992 flow [2023-01-27 18:04:39,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=992, PETRI_PLACES=101, PETRI_TRANSITIONS=98} [2023-01-27 18:04:39,316 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 56 predicate places. [2023-01-27 18:04:39,316 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 98 transitions, 992 flow [2023-01-27 18:04:39,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 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-01-27 18:04:39,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:39,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:04:39,317 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:39,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1987160477, now seen corresponding path program 1 times [2023-01-27 18:04:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878261555] [2023-01-27 18:04:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:39,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:39,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878261555] [2023-01-27 18:04:39,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878261555] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:39,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:39,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:04:39,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916114219] [2023-01-27 18:04:39,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:39,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:04:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:04:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:04:39,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-01-27 18:04:39,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 98 transitions, 992 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:39,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:39,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-01-27 18:04:39,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:41,234 INFO L130 PetriNetUnfolder]: 7181/11602 cut-off events. [2023-01-27 18:04:41,234 INFO L131 PetriNetUnfolder]: For 111909/113930 co-relation queries the response was YES. [2023-01-27 18:04:41,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69184 conditions, 11602 events. 7181/11602 cut-off events. For 111909/113930 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 83552 event pairs, 749 based on Foata normal form. 609/11864 useless extension candidates. Maximal degree in co-relation 69134. Up to 4329 conditions per place. [2023-01-27 18:04:41,302 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 59 selfloop transitions, 18 changer transitions 124/208 dead transitions. [2023-01-27 18:04:41,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 208 transitions, 2353 flow [2023-01-27 18:04:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:04:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:04:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1089 transitions. [2023-01-27 18:04:41,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062761506276151 [2023-01-27 18:04:41,305 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1089 transitions. [2023-01-27 18:04:41,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1089 transitions. [2023-01-27 18:04:41,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:41,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1089 transitions. [2023-01-27 18:04:41,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.0) internal successors, (1089), 9 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:41,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:41,310 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:41,310 INFO L175 Difference]: Start difference. First operand has 101 places, 98 transitions, 992 flow. Second operand 9 states and 1089 transitions. [2023-01-27 18:04:41,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 208 transitions, 2353 flow [2023-01-27 18:04:42,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 208 transitions, 2215 flow, removed 56 selfloop flow, removed 4 redundant places. [2023-01-27 18:04:42,191 INFO L231 Difference]: Finished difference. Result has 108 places, 51 transitions, 433 flow [2023-01-27 18:04:42,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=433, PETRI_PLACES=108, PETRI_TRANSITIONS=51} [2023-01-27 18:04:42,191 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 63 predicate places. [2023-01-27 18:04:42,191 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 51 transitions, 433 flow [2023-01-27 18:04:42,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:42,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:42,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:42,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:04:42,192 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:42,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2136879735, now seen corresponding path program 1 times [2023-01-27 18:04:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:42,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145684044] [2023-01-27 18:04:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:42,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:42,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145684044] [2023-01-27 18:04:42,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145684044] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:42,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:42,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:04:42,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808575011] [2023-01-27 18:04:42,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:42,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:04:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:42,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:04:42,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:04:42,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 239 [2023-01-27 18:04:42,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 51 transitions, 433 flow. Second operand has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:42,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:42,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 239 [2023-01-27 18:04:42,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:43,216 INFO L130 PetriNetUnfolder]: 1711/2820 cut-off events. [2023-01-27 18:04:43,217 INFO L131 PetriNetUnfolder]: For 20110/20400 co-relation queries the response was YES. [2023-01-27 18:04:43,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15019 conditions, 2820 events. 1711/2820 cut-off events. For 20110/20400 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15296 event pairs, 388 based on Foata normal form. 28/2742 useless extension candidates. Maximal degree in co-relation 14970. Up to 1541 conditions per place. [2023-01-27 18:04:43,234 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 64 selfloop transitions, 9 changer transitions 10/88 dead transitions. [2023-01-27 18:04:43,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 900 flow [2023-01-27 18:04:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:04:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:04:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions. [2023-01-27 18:04:43,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47419804741980476 [2023-01-27 18:04:43,236 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 680 transitions. [2023-01-27 18:04:43,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 680 transitions. [2023-01-27 18:04:43,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:43,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 680 transitions. [2023-01-27 18:04:43,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:43,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:43,239 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:43,239 INFO L175 Difference]: Start difference. First operand has 108 places, 51 transitions, 433 flow. Second operand 6 states and 680 transitions. [2023-01-27 18:04:43,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 88 transitions, 900 flow [2023-01-27 18:04:43,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 88 transitions, 649 flow, removed 85 selfloop flow, removed 29 redundant places. [2023-01-27 18:04:43,303 INFO L231 Difference]: Finished difference. Result has 76 places, 53 transitions, 350 flow [2023-01-27 18:04:43,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=76, PETRI_TRANSITIONS=53} [2023-01-27 18:04:43,304 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2023-01-27 18:04:43,304 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 53 transitions, 350 flow [2023-01-27 18:04:43,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:43,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:43,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:43,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:04:43,305 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:43,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash -315102337, now seen corresponding path program 2 times [2023-01-27 18:04:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:43,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433139791] [2023-01-27 18:04:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:04:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:04:44,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:04:44,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433139791] [2023-01-27 18:04:44,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433139791] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:04:44,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:04:44,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-27 18:04:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047983034] [2023-01-27 18:04:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:04:44,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 18:04:44,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:04:44,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 18:04:44,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-01-27 18:04:44,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 239 [2023-01-27 18:04:44,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 53 transitions, 350 flow. Second operand has 11 states, 11 states have (on average 104.27272727272727) internal successors, (1147), 11 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:44,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:04:44,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 239 [2023-01-27 18:04:44,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:04:45,058 INFO L130 PetriNetUnfolder]: 1666/2729 cut-off events. [2023-01-27 18:04:45,058 INFO L131 PetriNetUnfolder]: For 8964/9247 co-relation queries the response was YES. [2023-01-27 18:04:45,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11863 conditions, 2729 events. 1666/2729 cut-off events. For 8964/9247 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14656 event pairs, 559 based on Foata normal form. 32/2639 useless extension candidates. Maximal degree in co-relation 11837. Up to 1146 conditions per place. [2023-01-27 18:04:45,070 INFO L137 encePairwiseOnDemand]: 233/239 looper letters, 57 selfloop transitions, 5 changer transitions 36/103 dead transitions. [2023-01-27 18:04:45,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 833 flow [2023-01-27 18:04:45,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:04:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:04:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2023-01-27 18:04:45,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46582984658298465 [2023-01-27 18:04:45,073 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 668 transitions. [2023-01-27 18:04:45,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions. [2023-01-27 18:04:45,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:04:45,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions. [2023-01-27 18:04:45,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:45,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:45,075 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:45,075 INFO L175 Difference]: Start difference. First operand has 76 places, 53 transitions, 350 flow. Second operand 6 states and 668 transitions. [2023-01-27 18:04:45,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 833 flow [2023-01-27 18:04:45,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 103 transitions, 816 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-01-27 18:04:45,105 INFO L231 Difference]: Finished difference. Result has 77 places, 52 transitions, 351 flow [2023-01-27 18:04:45,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=77, PETRI_TRANSITIONS=52} [2023-01-27 18:04:45,106 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2023-01-27 18:04:45,106 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 52 transitions, 351 flow [2023-01-27 18:04:45,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.27272727272727) internal successors, (1147), 11 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:04:45,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:04:45,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:45,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 18:04:45,107 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:04:45,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:04:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1466274999, now seen corresponding path program 3 times [2023-01-27 18:04:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:04:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347540824] [2023-01-27 18:04:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:04:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:04:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:04:45,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:04:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:04:45,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:04:45,188 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:04:45,188 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:04:45,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:04:45,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:04:45,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:04:45,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:04:45,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:04:45,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:04:45,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 18:04:45,191 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:04:45,195 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:04:45,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:04:45,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:04:45 BasicIcfg [2023-01-27 18:04:45,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:04:45,243 INFO L158 Benchmark]: Toolchain (without parser) took 41345.52ms. Allocated memory was 350.2MB in the beginning and 5.4GB in the end (delta: 5.1GB). Free memory was 286.7MB in the beginning and 2.9GB in the end (delta: -2.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-01-27 18:04:45,243 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory is still 297.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:04:45,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.68ms. Allocated memory is still 350.2MB. Free memory was 286.3MB in the beginning and 262.3MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:04:45,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.86ms. Allocated memory is still 350.2MB. Free memory was 262.3MB in the beginning and 259.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:04:45,243 INFO L158 Benchmark]: Boogie Preprocessor took 20.97ms. Allocated memory is still 350.2MB. Free memory was 259.4MB in the beginning and 257.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:04:45,244 INFO L158 Benchmark]: RCFGBuilder took 669.62ms. Allocated memory was 350.2MB in the beginning and 656.4MB in the end (delta: 306.2MB). Free memory was 257.3MB in the beginning and 599.3MB in the end (delta: -342.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-27 18:04:45,244 INFO L158 Benchmark]: TraceAbstraction took 39991.74ms. Allocated memory was 656.4MB in the beginning and 5.4GB in the end (delta: 4.8GB). Free memory was 598.3MB in the beginning and 2.9GB in the end (delta: -2.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-01-27 18:04:45,245 INFO L339 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 350.2MB. Free memory is still 297.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 614.68ms. Allocated memory is still 350.2MB. Free memory was 286.3MB in the beginning and 262.3MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.86ms. Allocated memory is still 350.2MB. Free memory was 262.3MB in the beginning and 259.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.97ms. Allocated memory is still 350.2MB. Free memory was 259.4MB in the beginning and 257.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 669.62ms. Allocated memory was 350.2MB in the beginning and 656.4MB in the end (delta: 306.2MB). Free memory was 257.3MB in the beginning and 599.3MB in the end (delta: -342.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 39991.74ms. Allocated memory was 656.4MB in the beginning and 5.4GB in the end (delta: 4.8GB). Free memory was 598.3MB in the beginning and 2.9GB in the end (delta: -2.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 140 PlacesBefore, 45 PlacesAfterwards, 129 TransitionsBefore, 33 TransitionsAfterwards, 3272 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 9891 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4611, independent: 4352, independent conditional: 0, independent unconditional: 4352, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1718, independent: 1683, independent conditional: 0, independent unconditional: 1683, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4611, independent: 2669, independent conditional: 0, independent unconditional: 2669, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 1718, unknown conditional: 0, unknown unconditional: 1718] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=0, t145={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=1, t145={6:0}, t146={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=2, t145={6:0}, t146={7:0}, t147={8:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=3, t145={6:0}, t146={7:0}, t147={8:0}, t148={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={6:0}, t146={7:0}, t147={8:0}, t148={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 861]: 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: 865]: 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: 863]: 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, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 867 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2604 IncrementalHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 91 mSDtfsCounter, 2604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=992occurred in iteration=14, InterpolantAutomatonStates: 108, 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.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 3635 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-01-27 18:04:45,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...