./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26c011a0e45020881b0eb90c07839ec48e6b26942e49028568b078c64e0cf722 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:50:48,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:50:48,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:50:48,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:50:48,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:50:48,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:50:48,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:50:48,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:50:48,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:50:48,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:50:48,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:50:48,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:50:48,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:50:48,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:50:48,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:50:48,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:50:48,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:50:48,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:50:48,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:50:48,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:50:48,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:50:48,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:50:48,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:50:48,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:50:48,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:50:48,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:50:48,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:50:48,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:50:48,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:50:48,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:50:48,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:50:48,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:50:48,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:50:48,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:50:48,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:50:48,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:50:48,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:50:48,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:50:48,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:50:48,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:50:48,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:50:48,159 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:50:48,183 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:50:48,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:50:48,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:50:48,185 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:50:48,185 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:50:48,185 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:50:48,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:50:48,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:50:48,186 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:50:48,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:50:48,187 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:50:48,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:50:48,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:50:48,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:50:48,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:50:48,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:50:48,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:50:48,188 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:50:48,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:50:48,188 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:50:48,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:50:48,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:50:48,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:50:48,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:50:48,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:48,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:50:48,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:50:48,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:50:48,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:50:48,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:50:48,190 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:50:48,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:50:48,190 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:50:48,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:50:48,191 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:50:48,191 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26c011a0e45020881b0eb90c07839ec48e6b26942e49028568b078c64e0cf722 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:50:48,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:50:48,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:50:48,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:50:48,474 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:50:48,474 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:50:48,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2023-08-30 16:50:49,781 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:50:50,044 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:50:50,046 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2023-08-30 16:50:50,087 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b620cbd27/21ff4b6994494c6fb3044517e737facd/FLAGceaed0ec2 [2023-08-30 16:50:50,101 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b620cbd27/21ff4b6994494c6fb3044517e737facd [2023-08-30 16:50:50,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:50:50,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:50:50,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:50,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:50:50,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:50:50,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25839c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50, skipping insertion in model container [2023-08-30 16:50:50,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:50:50,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:50:50,290 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/mix040_tso.oepc.i[949,962] [2023-08-30 16:50:50,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:50,498 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:50:50,508 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/mix040_tso.oepc.i[949,962] [2023-08-30 16:50:50,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:50,620 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:50,621 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:50,625 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:50:50,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50 WrapperNode [2023-08-30 16:50:50,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:50,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:50,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:50:50,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:50:50,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,690 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-08-30 16:50:50,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:50,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:50:50,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:50:50,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:50:50,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,727 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:50:50,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:50:50,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:50:50,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:50:50,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (1/1) ... [2023-08-30 16:50:50,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:50,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:50:50,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:50:50,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:50:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:50:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:50:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:50:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:50:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:50:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:50:50,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:50:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:50:50,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:50:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:50:50,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:50:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:50:50,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:50:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:50:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:50:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:50:50,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:50:50,841 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:50:51,030 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:50:51,031 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:50:51,253 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:50:51,360 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:50:51,360 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:50:51,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:51 BoogieIcfgContainer [2023-08-30 16:50:51,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:50:51,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:50:51,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:50:51,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:50:51,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:50:50" (1/3) ... [2023-08-30 16:50:51,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f57ebeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:51, skipping insertion in model container [2023-08-30 16:50:51,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:50" (2/3) ... [2023-08-30 16:50:51,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f57ebeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:51, skipping insertion in model container [2023-08-30 16:50:51,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:51" (3/3) ... [2023-08-30 16:50:51,367 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2023-08-30 16:50:51,372 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:50:51,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:50:51,378 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:50:51,379 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:50:51,413 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:50:51,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 16:50:51,478 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 16:50:51,478 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:51,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 16:50:51,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 16:50:51,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-08-30 16:50:51,488 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:50:51,496 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 16:50:51,498 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 16:50:51,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-08-30 16:50:51,528 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 16:50:51,530 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:51,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 16:50:51,533 INFO L119 LiptonReduction]: Number of co-enabled transitions 3090 [2023-08-30 16:50:55,751 INFO L134 LiptonReduction]: Checked pairs total: 7976 [2023-08-30 16:50:55,751 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-30 16:50:55,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:50:55,765 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62b03b3e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:50:55,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:50:55,769 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-08-30 16:50:55,769 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:55,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:55,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:55,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:55,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1317619857, now seen corresponding path program 1 times [2023-08-30 16:50:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:55,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981920247] [2023-08-30 16:50:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:56,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:56,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981920247] [2023-08-30 16:50:56,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981920247] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:56,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:56,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409456131] [2023-08-30 16:50:56,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:56,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:56,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:56,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242 [2023-08-30 16:50:56,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:56,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:56,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242 [2023-08-30 16:50:56,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:56,677 INFO L130 PetriNetUnfolder]: 3567/5262 cut-off events. [2023-08-30 16:50:56,677 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2023-08-30 16:50:56,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10290 conditions, 5262 events. 3567/5262 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29454 event pairs, 678 based on Foata normal form. 0/4994 useless extension candidates. Maximal degree in co-relation 10278. Up to 3862 conditions per place. [2023-08-30 16:50:56,716 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-08-30 16:50:56,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 179 flow [2023-08-30 16:50:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 16:50:56,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344352617079889 [2023-08-30 16:50:56,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 16:50:56,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 16:50:56,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:56,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 16:50:56,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:56,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:56,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:56,742 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 388 transitions. [2023-08-30 16:50:56,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 179 flow [2023-08-30 16:50:56,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:56,747 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-30 16:50:56,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-30 16:50:56,751 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-30 16:50:56,752 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-30 16:50:56,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:56,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:56,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:56,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:50:56,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:56,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash 580403258, now seen corresponding path program 1 times [2023-08-30 16:50:56,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:56,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300411373] [2023-08-30 16:50:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:56,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:57,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300411373] [2023-08-30 16:50:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300411373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:57,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:57,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:57,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213146557] [2023-08-30 16:50:57,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:57,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:57,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:57,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:57,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:57,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 242 [2023-08-30 16:50:57,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:57,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:57,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 242 [2023-08-30 16:50:57,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:58,452 INFO L130 PetriNetUnfolder]: 8041/11490 cut-off events. [2023-08-30 16:50:58,452 INFO L131 PetriNetUnfolder]: For 586/586 co-relation queries the response was YES. [2023-08-30 16:50:58,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23454 conditions, 11490 events. 8041/11490 cut-off events. For 586/586 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 64829 event pairs, 605 based on Foata normal form. 300/11790 useless extension candidates. Maximal degree in co-relation 23444. Up to 8419 conditions per place. [2023-08-30 16:50:58,499 INFO L137 encePairwiseOnDemand]: 230/242 looper letters, 52 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2023-08-30 16:50:58,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 288 flow [2023-08-30 16:50:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-30 16:50:58,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989669421487603 [2023-08-30 16:50:58,501 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-30 16:50:58,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-30 16:50:58,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:58,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-30 16:50:58,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:58,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:58,505 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:58,505 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 4 states and 483 transitions. [2023-08-30 16:50:58,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 288 flow [2023-08-30 16:50:58,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:58,507 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 146 flow [2023-08-30 16:50:58,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2023-08-30 16:50:58,507 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-08-30 16:50:58,508 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 146 flow [2023-08-30 16:50:58,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:58,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:58,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:58,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:50:58,508 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:58,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash 812629623, now seen corresponding path program 1 times [2023-08-30 16:50:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:58,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79949538] [2023-08-30 16:50:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79949538] [2023-08-30 16:50:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79949538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:58,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958781338] [2023-08-30 16:50:58,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:58,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:58,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:58,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:58,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242 [2023-08-30 16:50:58,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:58,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:58,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242 [2023-08-30 16:50:58,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:59,922 INFO L130 PetriNetUnfolder]: 8417/11969 cut-off events. [2023-08-30 16:50:59,923 INFO L131 PetriNetUnfolder]: For 4772/4807 co-relation queries the response was YES. [2023-08-30 16:50:59,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32327 conditions, 11969 events. 8417/11969 cut-off events. For 4772/4807 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 65696 event pairs, 2553 based on Foata normal form. 56/11814 useless extension candidates. Maximal degree in co-relation 32315. Up to 10329 conditions per place. [2023-08-30 16:50:59,976 INFO L137 encePairwiseOnDemand]: 237/242 looper letters, 46 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2023-08-30 16:50:59,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 322 flow [2023-08-30 16:50:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-30 16:50:59,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330578512396694 [2023-08-30 16:50:59,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-30 16:50:59,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-30 16:50:59,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:59,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-30 16:50:59,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:59,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:59,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:59,981 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 146 flow. Second operand 3 states and 387 transitions. [2023-08-30 16:50:59,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 322 flow [2023-08-30 16:50:59,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:50:59,984 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 196 flow [2023-08-30 16:50:59,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-08-30 16:50:59,984 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-30 16:50:59,984 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 196 flow [2023-08-30 16:50:59,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:59,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:59,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:59,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:50:59,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:59,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1099659371, now seen corresponding path program 1 times [2023-08-30 16:50:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628238684] [2023-08-30 16:50:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628238684] [2023-08-30 16:51:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628238684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:00,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:00,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:51:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597280539] [2023-08-30 16:51:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:00,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:00,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:00,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:00,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 242 [2023-08-30 16:51:00,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:00,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:00,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 242 [2023-08-30 16:51:00,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:01,314 INFO L130 PetriNetUnfolder]: 8859/12330 cut-off events. [2023-08-30 16:51:01,315 INFO L131 PetriNetUnfolder]: For 5852/5854 co-relation queries the response was YES. [2023-08-30 16:51:01,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36203 conditions, 12330 events. 8859/12330 cut-off events. For 5852/5854 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 61833 event pairs, 2413 based on Foata normal form. 168/12496 useless extension candidates. Maximal degree in co-relation 36188. Up to 6919 conditions per place. [2023-08-30 16:51:01,367 INFO L137 encePairwiseOnDemand]: 230/242 looper letters, 53 selfloop transitions, 15 changer transitions 0/70 dead transitions. [2023-08-30 16:51:01,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 441 flow [2023-08-30 16:51:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-30 16:51:01,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4834710743801653 [2023-08-30 16:51:01,371 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-30 16:51:01,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-30 16:51:01,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:01,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-30 16:51:01,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:01,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:01,374 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:01,374 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 196 flow. Second operand 4 states and 468 transitions. [2023-08-30 16:51:01,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 441 flow [2023-08-30 16:51:01,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:01,380 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 320 flow [2023-08-30 16:51:01,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2023-08-30 16:51:01,381 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-30 16:51:01,381 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 320 flow [2023-08-30 16:51:01,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:01,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:01,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:01,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:51:01,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:01,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:01,383 INFO L85 PathProgramCache]: Analyzing trace with hash -270777837, now seen corresponding path program 1 times [2023-08-30 16:51:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:01,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792685515] [2023-08-30 16:51:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792685515] [2023-08-30 16:51:01,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792685515] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:01,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:01,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:51:01,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955319656] [2023-08-30 16:51:01,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:01,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:01,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:01,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:01,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 242 [2023-08-30 16:51:01,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:01,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:01,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 242 [2023-08-30 16:51:01,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:02,609 INFO L130 PetriNetUnfolder]: 7873/11255 cut-off events. [2023-08-30 16:51:02,609 INFO L131 PetriNetUnfolder]: For 15982/16248 co-relation queries the response was YES. [2023-08-30 16:51:02,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37293 conditions, 11255 events. 7873/11255 cut-off events. For 15982/16248 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 61614 event pairs, 1685 based on Foata normal form. 226/11249 useless extension candidates. Maximal degree in co-relation 37274. Up to 8168 conditions per place. [2023-08-30 16:51:02,655 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 69 selfloop transitions, 20 changer transitions 0/98 dead transitions. [2023-08-30 16:51:02,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 751 flow [2023-08-30 16:51:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-30 16:51:02,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53099173553719 [2023-08-30 16:51:02,657 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-30 16:51:02,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-30 16:51:02,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:02,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-30 16:51:02,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:02,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:02,660 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:02,661 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 320 flow. Second operand 4 states and 514 transitions. [2023-08-30 16:51:02,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 751 flow [2023-08-30 16:51:02,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:02,679 INFO L231 Difference]: Finished difference. Result has 53 places, 64 transitions, 494 flow [2023-08-30 16:51:02,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=494, PETRI_PLACES=53, PETRI_TRANSITIONS=64} [2023-08-30 16:51:02,681 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-08-30 16:51:02,682 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 64 transitions, 494 flow [2023-08-30 16:51:02,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:02,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:02,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:02,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:51:02,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:02,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash -322470957, now seen corresponding path program 2 times [2023-08-30 16:51:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948020699] [2023-08-30 16:51:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:02,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:02,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948020699] [2023-08-30 16:51:02,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948020699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:02,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:02,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408855446] [2023-08-30 16:51:02,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:02,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:02,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:02,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:02,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 242 [2023-08-30 16:51:02,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 64 transitions, 494 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:02,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:02,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 242 [2023-08-30 16:51:02,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:03,776 INFO L130 PetriNetUnfolder]: 7755/11085 cut-off events. [2023-08-30 16:51:03,777 INFO L131 PetriNetUnfolder]: For 23314/23708 co-relation queries the response was YES. [2023-08-30 16:51:03,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41355 conditions, 11085 events. 7755/11085 cut-off events. For 23314/23708 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 60396 event pairs, 1421 based on Foata normal form. 388/11191 useless extension candidates. Maximal degree in co-relation 41333. Up to 8133 conditions per place. [2023-08-30 16:51:03,827 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 80 selfloop transitions, 14 changer transitions 0/103 dead transitions. [2023-08-30 16:51:03,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 103 transitions, 911 flow [2023-08-30 16:51:03,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:03,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-08-30 16:51:03,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5299586776859504 [2023-08-30 16:51:03,829 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-08-30 16:51:03,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-08-30 16:51:03,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:03,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-08-30 16:51:03,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:03,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:03,832 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:03,832 INFO L175 Difference]: Start difference. First operand has 53 places, 64 transitions, 494 flow. Second operand 4 states and 513 transitions. [2023-08-30 16:51:03,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 103 transitions, 911 flow [2023-08-30 16:51:03,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 103 transitions, 889 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:03,848 INFO L231 Difference]: Finished difference. Result has 56 places, 66 transitions, 533 flow [2023-08-30 16:51:03,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=533, PETRI_PLACES=56, PETRI_TRANSITIONS=66} [2023-08-30 16:51:03,850 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-30 16:51:03,850 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 66 transitions, 533 flow [2023-08-30 16:51:03,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:03,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:03,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:03,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:51:03,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:03,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:03,852 INFO L85 PathProgramCache]: Analyzing trace with hash -270775419, now seen corresponding path program 1 times [2023-08-30 16:51:03,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:03,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858650281] [2023-08-30 16:51:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:03,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:04,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858650281] [2023-08-30 16:51:04,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858650281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:04,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:04,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008737258] [2023-08-30 16:51:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:04,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:04,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:04,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:04,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:04,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:51:04,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 66 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:04,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:04,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:51:04,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:05,120 INFO L130 PetriNetUnfolder]: 7803/11197 cut-off events. [2023-08-30 16:51:05,121 INFO L131 PetriNetUnfolder]: For 27832/28252 co-relation queries the response was YES. [2023-08-30 16:51:05,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42154 conditions, 11197 events. 7803/11197 cut-off events. For 27832/28252 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 61890 event pairs, 1734 based on Foata normal form. 426/11345 useless extension candidates. Maximal degree in co-relation 42130. Up to 8479 conditions per place. [2023-08-30 16:51:05,175 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 83 selfloop transitions, 14 changer transitions 0/106 dead transitions. [2023-08-30 16:51:05,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 106 transitions, 944 flow [2023-08-30 16:51:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2023-08-30 16:51:05,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268595041322314 [2023-08-30 16:51:05,177 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2023-08-30 16:51:05,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2023-08-30 16:51:05,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:05,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2023-08-30 16:51:05,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:05,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:05,179 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:05,179 INFO L175 Difference]: Start difference. First operand has 56 places, 66 transitions, 533 flow. Second operand 4 states and 510 transitions. [2023-08-30 16:51:05,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 106 transitions, 944 flow [2023-08-30 16:51:05,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 106 transitions, 932 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:05,196 INFO L231 Difference]: Finished difference. Result has 60 places, 72 transitions, 631 flow [2023-08-30 16:51:05,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=631, PETRI_PLACES=60, PETRI_TRANSITIONS=72} [2023-08-30 16:51:05,197 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-08-30 16:51:05,197 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 72 transitions, 631 flow [2023-08-30 16:51:05,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:05,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:05,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:05,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:51:05,197 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:05,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash 195820663, now seen corresponding path program 1 times [2023-08-30 16:51:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834960853] [2023-08-30 16:51:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:05,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834960853] [2023-08-30 16:51:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834960853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:05,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:05,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850803941] [2023-08-30 16:51:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:05,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:05,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:51:05,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 72 transitions, 631 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:05,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:05,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:51:05,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:06,611 INFO L130 PetriNetUnfolder]: 8434/12052 cut-off events. [2023-08-30 16:51:06,611 INFO L131 PetriNetUnfolder]: For 39142/39740 co-relation queries the response was YES. [2023-08-30 16:51:06,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48355 conditions, 12052 events. 8434/12052 cut-off events. For 39142/39740 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 67239 event pairs, 1505 based on Foata normal form. 388/12136 useless extension candidates. Maximal degree in co-relation 48328. Up to 8683 conditions per place. [2023-08-30 16:51:06,681 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 83 selfloop transitions, 33 changer transitions 0/125 dead transitions. [2023-08-30 16:51:06,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 125 transitions, 1169 flow [2023-08-30 16:51:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:51:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:51:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2023-08-30 16:51:06,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247933884297521 [2023-08-30 16:51:06,684 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2023-08-30 16:51:06,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2023-08-30 16:51:06,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:06,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2023-08-30 16:51:06,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:06,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:06,687 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:06,687 INFO L175 Difference]: Start difference. First operand has 60 places, 72 transitions, 631 flow. Second operand 5 states and 635 transitions. [2023-08-30 16:51:06,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 125 transitions, 1169 flow [2023-08-30 16:51:06,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 125 transitions, 1144 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:06,722 INFO L231 Difference]: Finished difference. Result has 63 places, 83 transitions, 813 flow [2023-08-30 16:51:06,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=813, PETRI_PLACES=63, PETRI_TRANSITIONS=83} [2023-08-30 16:51:06,723 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-08-30 16:51:06,723 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 83 transitions, 813 flow [2023-08-30 16:51:06,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:06,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:06,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:06,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:51:06,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:06,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash 109056313, now seen corresponding path program 2 times [2023-08-30 16:51:06,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:06,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391838684] [2023-08-30 16:51:06,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:06,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391838684] [2023-08-30 16:51:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391838684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684888813] [2023-08-30 16:51:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:07,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:07,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:07,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:07,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:07,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 242 [2023-08-30 16:51:07,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 83 transitions, 813 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:07,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:07,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 242 [2023-08-30 16:51:07,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:08,672 INFO L130 PetriNetUnfolder]: 12415/17008 cut-off events. [2023-08-30 16:51:08,672 INFO L131 PetriNetUnfolder]: For 54938/54938 co-relation queries the response was YES. [2023-08-30 16:51:08,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71122 conditions, 17008 events. 12415/17008 cut-off events. For 54938/54938 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 87282 event pairs, 2825 based on Foata normal form. 64/17072 useless extension candidates. Maximal degree in co-relation 71094. Up to 11052 conditions per place. [2023-08-30 16:51:08,774 INFO L137 encePairwiseOnDemand]: 229/242 looper letters, 89 selfloop transitions, 90 changer transitions 0/179 dead transitions. [2023-08-30 16:51:08,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 179 transitions, 1790 flow [2023-08-30 16:51:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:51:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:51:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 811 transitions. [2023-08-30 16:51:08,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787485242030697 [2023-08-30 16:51:08,780 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 811 transitions. [2023-08-30 16:51:08,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 811 transitions. [2023-08-30 16:51:08,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:08,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 811 transitions. [2023-08-30 16:51:08,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:08,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:08,785 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:08,785 INFO L175 Difference]: Start difference. First operand has 63 places, 83 transitions, 813 flow. Second operand 7 states and 811 transitions. [2023-08-30 16:51:08,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 179 transitions, 1790 flow [2023-08-30 16:51:08,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 179 transitions, 1702 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-30 16:51:08,883 INFO L231 Difference]: Finished difference. Result has 71 places, 135 transitions, 1621 flow [2023-08-30 16:51:08,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1621, PETRI_PLACES=71, PETRI_TRANSITIONS=135} [2023-08-30 16:51:08,884 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-08-30 16:51:08,884 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 135 transitions, 1621 flow [2023-08-30 16:51:08,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:08,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:08,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:08,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:51:08,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:08,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:08,885 INFO L85 PathProgramCache]: Analyzing trace with hash 937447835, now seen corresponding path program 3 times [2023-08-30 16:51:08,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:08,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819743933] [2023-08-30 16:51:08,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:09,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:09,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819743933] [2023-08-30 16:51:09,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819743933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:09,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:09,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:09,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852641992] [2023-08-30 16:51:09,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:09,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:09,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:09,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:09,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:09,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-30 16:51:09,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 135 transitions, 1621 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:09,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:09,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-30 16:51:09,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:11,002 INFO L130 PetriNetUnfolder]: 15491/22071 cut-off events. [2023-08-30 16:51:11,003 INFO L131 PetriNetUnfolder]: For 151722/152958 co-relation queries the response was YES. [2023-08-30 16:51:11,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113867 conditions, 22071 events. 15491/22071 cut-off events. For 151722/152958 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 134036 event pairs, 2418 based on Foata normal form. 986/22520 useless extension candidates. Maximal degree in co-relation 113834. Up to 11058 conditions per place. [2023-08-30 16:51:11,129 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 160 selfloop transitions, 59 changer transitions 0/243 dead transitions. [2023-08-30 16:51:11,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 243 transitions, 3091 flow [2023-08-30 16:51:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:51:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:51:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 762 transitions. [2023-08-30 16:51:11,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247933884297521 [2023-08-30 16:51:11,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 762 transitions. [2023-08-30 16:51:11,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 762 transitions. [2023-08-30 16:51:11,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:11,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 762 transitions. [2023-08-30 16:51:11,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:11,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:11,137 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:11,137 INFO L175 Difference]: Start difference. First operand has 71 places, 135 transitions, 1621 flow. Second operand 6 states and 762 transitions. [2023-08-30 16:51:11,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 243 transitions, 3091 flow [2023-08-30 16:51:11,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 243 transitions, 2874 flow, removed 108 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:11,569 INFO L231 Difference]: Finished difference. Result has 79 places, 169 transitions, 2182 flow [2023-08-30 16:51:11,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2182, PETRI_PLACES=79, PETRI_TRANSITIONS=169} [2023-08-30 16:51:11,569 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2023-08-30 16:51:11,570 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 169 transitions, 2182 flow [2023-08-30 16:51:11,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:11,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:11,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:11,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:51:11,570 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:11,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash 112776313, now seen corresponding path program 4 times [2023-08-30 16:51:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508115983] [2023-08-30 16:51:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:11,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508115983] [2023-08-30 16:51:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508115983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:11,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:11,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:11,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368499783] [2023-08-30 16:51:11,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:11,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:11,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:11,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:11,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-30 16:51:11,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 169 transitions, 2182 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:11,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:11,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-30 16:51:11,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:14,061 INFO L130 PetriNetUnfolder]: 16666/23862 cut-off events. [2023-08-30 16:51:14,062 INFO L131 PetriNetUnfolder]: For 166850/168655 co-relation queries the response was YES. [2023-08-30 16:51:14,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124328 conditions, 23862 events. 16666/23862 cut-off events. For 166850/168655 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 147368 event pairs, 3066 based on Foata normal form. 1689/25064 useless extension candidates. Maximal degree in co-relation 124290. Up to 15072 conditions per place. [2023-08-30 16:51:14,697 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 131 selfloop transitions, 75 changer transitions 0/230 dead transitions. [2023-08-30 16:51:14,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 230 transitions, 3072 flow [2023-08-30 16:51:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:51:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:51:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2023-08-30 16:51:14,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512396694214876 [2023-08-30 16:51:14,703 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2023-08-30 16:51:14,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2023-08-30 16:51:14,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:14,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2023-08-30 16:51:14,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:14,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:14,707 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:14,707 INFO L175 Difference]: Start difference. First operand has 79 places, 169 transitions, 2182 flow. Second operand 6 states and 744 transitions. [2023-08-30 16:51:14,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 230 transitions, 3072 flow [2023-08-30 16:51:15,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 230 transitions, 3056 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:15,157 INFO L231 Difference]: Finished difference. Result has 84 places, 176 transitions, 2481 flow [2023-08-30 16:51:15,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2481, PETRI_PLACES=84, PETRI_TRANSITIONS=176} [2023-08-30 16:51:15,158 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2023-08-30 16:51:15,158 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 176 transitions, 2481 flow [2023-08-30 16:51:15,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:15,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:15,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:15,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:51:15,159 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:15,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash -914340282, now seen corresponding path program 1 times [2023-08-30 16:51:15,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148831281] [2023-08-30 16:51:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:15,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148831281] [2023-08-30 16:51:15,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148831281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:15,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:15,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320607367] [2023-08-30 16:51:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:15,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:51:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:15,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:51:15,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:51:15,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-30 16:51:15,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 176 transitions, 2481 flow. Second operand has 7 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-08-30 16:51:15,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:15,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-30 16:51:15,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:18,373 INFO L130 PetriNetUnfolder]: 19070/26627 cut-off events. [2023-08-30 16:51:18,373 INFO L131 PetriNetUnfolder]: For 203390/203839 co-relation queries the response was YES. [2023-08-30 16:51:18,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146570 conditions, 26627 events. 19070/26627 cut-off events. For 203390/203839 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 156136 event pairs, 3514 based on Foata normal form. 422/26807 useless extension candidates. Maximal degree in co-relation 146530. Up to 21422 conditions per place. [2023-08-30 16:51:18,557 INFO L137 encePairwiseOnDemand]: 231/242 looper letters, 198 selfloop transitions, 66 changer transitions 0/273 dead transitions. [2023-08-30 16:51:18,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 273 transitions, 3797 flow [2023-08-30 16:51:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:51:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:51:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-08-30 16:51:18,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49763872491145217 [2023-08-30 16:51:18,560 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-08-30 16:51:18,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-08-30 16:51:18,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:18,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-08-30 16:51:18,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:18,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:18,565 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:18,565 INFO L175 Difference]: Start difference. First operand has 84 places, 176 transitions, 2481 flow. Second operand 7 states and 843 transitions. [2023-08-30 16:51:18,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 273 transitions, 3797 flow [2023-08-30 16:51:19,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 273 transitions, 3688 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-30 16:51:19,228 INFO L231 Difference]: Finished difference. Result has 88 places, 202 transitions, 2902 flow [2023-08-30 16:51:19,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2380, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2902, PETRI_PLACES=88, PETRI_TRANSITIONS=202} [2023-08-30 16:51:19,229 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2023-08-30 16:51:19,229 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 202 transitions, 2902 flow [2023-08-30 16:51:19,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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-08-30 16:51:19,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:19,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:19,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:51:19,230 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:19,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash 111315792, now seen corresponding path program 2 times [2023-08-30 16:51:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412118265] [2023-08-30 16:51:19,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:19,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:19,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412118265] [2023-08-30 16:51:19,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412118265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:19,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:19,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316034801] [2023-08-30 16:51:19,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:19,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:51:19,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:19,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:51:19,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:51:19,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:51:19,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 202 transitions, 2902 flow. Second operand has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:19,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:19,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:51:19,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:22,812 INFO L130 PetriNetUnfolder]: 17168/24570 cut-off events. [2023-08-30 16:51:22,812 INFO L131 PetriNetUnfolder]: For 225297/227235 co-relation queries the response was YES. [2023-08-30 16:51:22,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140689 conditions, 24570 events. 17168/24570 cut-off events. For 225297/227235 co-relation queries the response was YES. Maximal size of possible extension queue 1158. Compared 152631 event pairs, 2814 based on Foata normal form. 947/24878 useless extension candidates. Maximal degree in co-relation 140648. Up to 13583 conditions per place. [2023-08-30 16:51:22,992 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 183 selfloop transitions, 75 changer transitions 0/285 dead transitions. [2023-08-30 16:51:22,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 285 transitions, 4362 flow [2023-08-30 16:51:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:51:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:51:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-30 16:51:22,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2023-08-30 16:51:22,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-30 16:51:22,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-30 16:51:22,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:22,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-30 16:51:22,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:22,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:22,998 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:22,998 INFO L175 Difference]: Start difference. First operand has 88 places, 202 transitions, 2902 flow. Second operand 5 states and 627 transitions. [2023-08-30 16:51:22,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 285 transitions, 4362 flow [2023-08-30 16:51:23,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 285 transitions, 4295 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:23,600 INFO L231 Difference]: Finished difference. Result has 91 places, 218 transitions, 3355 flow [2023-08-30 16:51:23,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2835, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3355, PETRI_PLACES=91, PETRI_TRANSITIONS=218} [2023-08-30 16:51:23,601 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2023-08-30 16:51:23,601 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 218 transitions, 3355 flow [2023-08-30 16:51:23,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:23,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:23,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:23,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:51:23,602 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:23,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash -560184282, now seen corresponding path program 1 times [2023-08-30 16:51:23,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:23,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718327446] [2023-08-30 16:51:23,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:23,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:23,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:23,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718327446] [2023-08-30 16:51:23,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718327446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:23,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:23,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:23,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865702846] [2023-08-30 16:51:23,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:23,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:23,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:23,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:23,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 242 [2023-08-30 16:51:23,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 218 transitions, 3355 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:23,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:23,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 242 [2023-08-30 16:51:23,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:28,362 INFO L130 PetriNetUnfolder]: 26853/37633 cut-off events. [2023-08-30 16:51:28,362 INFO L131 PetriNetUnfolder]: For 354069/356920 co-relation queries the response was YES. [2023-08-30 16:51:28,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219710 conditions, 37633 events. 26853/37633 cut-off events. For 354069/356920 co-relation queries the response was YES. Maximal size of possible extension queue 1675. Compared 236116 event pairs, 1677 based on Foata normal form. 2633/40035 useless extension candidates. Maximal degree in co-relation 219667. Up to 18243 conditions per place. [2023-08-30 16:51:28,624 INFO L137 encePairwiseOnDemand]: 229/242 looper letters, 171 selfloop transitions, 142 changer transitions 118/443 dead transitions. [2023-08-30 16:51:28,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 443 transitions, 7403 flow [2023-08-30 16:51:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:51:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:51:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2023-08-30 16:51:28,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807162534435262 [2023-08-30 16:51:28,635 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 698 transitions. [2023-08-30 16:51:28,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 698 transitions. [2023-08-30 16:51:28,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:28,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 698 transitions. [2023-08-30 16:51:28,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:28,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:28,639 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:28,639 INFO L175 Difference]: Start difference. First operand has 91 places, 218 transitions, 3355 flow. Second operand 6 states and 698 transitions. [2023-08-30 16:51:28,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 443 transitions, 7403 flow [2023-08-30 16:51:29,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 443 transitions, 7220 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-30 16:51:29,748 INFO L231 Difference]: Finished difference. Result has 97 places, 253 transitions, 4385 flow [2023-08-30 16:51:29,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=3259, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4385, PETRI_PLACES=97, PETRI_TRANSITIONS=253} [2023-08-30 16:51:29,749 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2023-08-30 16:51:29,749 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 253 transitions, 4385 flow [2023-08-30 16:51:29,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:29,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:29,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:29,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:51:29,750 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:29,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash 925871514, now seen corresponding path program 2 times [2023-08-30 16:51:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:29,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168146340] [2023-08-30 16:51:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:29,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:29,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168146340] [2023-08-30 16:51:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168146340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:29,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678408615] [2023-08-30 16:51:29,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:29,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:29,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:51:29,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 253 transitions, 4385 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:29,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:29,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:51:29,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:31,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L801-->L808: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_102) v_~y$w_buff0_used~0_101) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_20 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$r_buff0_thd3~0_20 (ite .cse3 0 v_~y$r_buff0_thd3~0_21)) (= v_~y~0_67 (ite .cse0 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_42 v_~y~0_68))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_68, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_67, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][136], [Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 113#L756true, Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), P1Thread1of1ForFork1InUse, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 45#L808true, Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 70#L771true, 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 108#L827true, 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 203#(= ~y$r_buff0_thd0~0 0), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:31,414 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,414 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,414 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,414 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,414 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][247], [Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 113#L756true, Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), 107#L801true, P1Thread1of1ForFork1InUse, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 82#L834true, Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 70#L771true, 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), 203#(= ~y$r_buff0_thd0~0 0), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:31,414 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,415 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,415 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,415 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,415 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L771-->L778: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_53 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_24 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_54 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_49 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_23 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_48 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite .cse2 0 v_~y$w_buff0_used~0_54) v_~y$w_buff0_used~0_53) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_49) v_~y$w_buff1_used~0_48) (= v_~y~0_25 (ite .cse2 v_~y$w_buff0~0_13 (ite .cse3 v_~y$w_buff1~0_12 v_~y~0_26))) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_24) v_~y$r_buff0_thd2~0_23)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_54, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_23, ~y~0=v_~y~0_25, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][137], [Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 113#L756true, Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 114#L778true, Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 107#L801true, P1Thread1of1ForFork1InUse, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 267#(= ~z~0 1), 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 108#L827true, 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), 203#(= ~y$r_buff0_thd0~0 0), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:31,415 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,416 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,416 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,416 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:31,614 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L801-->L808: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_102) v_~y$w_buff0_used~0_101) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_20 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$r_buff0_thd3~0_20 (ite .cse3 0 v_~y$r_buff0_thd3~0_21)) (= v_~y~0_67 (ite .cse0 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_42 v_~y~0_68))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_68, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_67, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][256], [Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 111#P0EXITtrue, Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), P1Thread1of1ForFork1InUse, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), 45#L808true, Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, 70#L771true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 149#true, 108#L827true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), 203#(= ~y$r_buff0_thd0~0 0), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:31,614 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:31,614 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:31,615 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:31,615 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:31,615 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][405], [Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 111#P0EXITtrue, Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), 107#L801true, P1Thread1of1ForFork1InUse, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P0Thread1of1ForFork3InUse, 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 82#L834true, Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, 70#L771true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 203#(= ~y$r_buff0_thd0~0 0), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:31,615 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:31,615 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:31,615 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:31,615 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:32,059 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L771-->L778: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_53 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_24 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_54 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_49 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_23 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_48 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite .cse2 0 v_~y$w_buff0_used~0_54) v_~y$w_buff0_used~0_53) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_49) v_~y$w_buff1_used~0_48) (= v_~y~0_25 (ite .cse2 v_~y$w_buff0~0_13 (ite .cse3 v_~y$w_buff1~0_12 v_~y~0_26))) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_24) v_~y$r_buff0_thd2~0_23)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_54, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_23, ~y~0=v_~y~0_25, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][257], [Black: 190#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 111#P0EXITtrue, Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 114#L778true, Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 107#L801true, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P1Thread1of1ForFork1InUse, 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 108#L827true, 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 203#(= ~y$r_buff0_thd0~0 0), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:32,060 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-30 16:51:32,060 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 16:51:32,060 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 16:51:32,060 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 16:51:33,019 INFO L130 PetriNetUnfolder]: 16193/24062 cut-off events. [2023-08-30 16:51:33,019 INFO L131 PetriNetUnfolder]: For 346726/352456 co-relation queries the response was YES. [2023-08-30 16:51:33,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143958 conditions, 24062 events. 16193/24062 cut-off events. For 346726/352456 co-relation queries the response was YES. Maximal size of possible extension queue 1528. Compared 168427 event pairs, 3026 based on Foata normal form. 5473/28708 useless extension candidates. Maximal degree in co-relation 143911. Up to 15053 conditions per place. [2023-08-30 16:51:33,186 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 479 selfloop transitions, 10 changer transitions 22/555 dead transitions. [2023-08-30 16:51:33,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 555 transitions, 10916 flow [2023-08-30 16:51:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:51:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:51:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-08-30 16:51:33,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148760330578512 [2023-08-30 16:51:33,189 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-08-30 16:51:33,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-08-30 16:51:33,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:33,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-08-30 16:51:33,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,192 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,192 INFO L175 Difference]: Start difference. First operand has 97 places, 253 transitions, 4385 flow. Second operand 5 states and 623 transitions. [2023-08-30 16:51:33,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 555 transitions, 10916 flow [2023-08-30 16:51:33,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 555 transitions, 10690 flow, removed 79 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:33,498 INFO L231 Difference]: Finished difference. Result has 102 places, 224 transitions, 3683 flow [2023-08-30 16:51:33,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=3524, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3683, PETRI_PLACES=102, PETRI_TRANSITIONS=224} [2023-08-30 16:51:33,499 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2023-08-30 16:51:33,499 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 224 transitions, 3683 flow [2023-08-30 16:51:33,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:33,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:33,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:51:33,500 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:33,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:33,500 INFO L85 PathProgramCache]: Analyzing trace with hash -786013469, now seen corresponding path program 1 times [2023-08-30 16:51:33,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:33,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554566853] [2023-08-30 16:51:33,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:33,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:33,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554566853] [2023-08-30 16:51:33,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554566853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:33,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:33,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:33,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619281842] [2023-08-30 16:51:33,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:33,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:33,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:33,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:51:33,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 224 transitions, 3683 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:33,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:51:33,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:34,979 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L801-->L808: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_102) v_~y$w_buff0_used~0_101) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_20 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$r_buff0_thd3~0_20 (ite .cse3 0 v_~y$r_buff0_thd3~0_21)) (= v_~y~0_67 (ite .cse0 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_42 v_~y~0_68))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_68, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_67, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][137], [113#L756true, Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 45#L808true, Black: 283#(= ~__unbuffered_cnt~0 0), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 70#L771true, 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 149#true, 108#L827true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 203#(= ~y$r_buff0_thd0~0 0), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 297#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:34,980 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:34,980 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:34,980 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:34,980 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:34,980 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L771-->L778: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_53 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_24 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_54 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_49 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_23 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_48 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite .cse2 0 v_~y$w_buff0_used~0_54) v_~y$w_buff0_used~0_53) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_49) v_~y$w_buff1_used~0_48) (= v_~y~0_25 (ite .cse2 v_~y$w_buff0~0_13 (ite .cse3 v_~y$w_buff1~0_12 v_~y~0_26))) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_24) v_~y$r_buff0_thd2~0_23)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_54, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_23, ~y~0=v_~y~0_25, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][138], [113#L756true, Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 114#L778true, Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 107#L801true, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 265#true, 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 283#(= ~__unbuffered_cnt~0 0), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 149#true, 108#L827true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), 203#(= ~y$r_buff0_thd0~0 0), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 297#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:34,981 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:34,981 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:34,981 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:34,981 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:35,096 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L801-->L808: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_102) v_~y$w_buff0_used~0_101) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_20 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$r_buff0_thd3~0_20 (ite .cse3 0 v_~y$r_buff0_thd3~0_21)) (= v_~y~0_67 (ite .cse0 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_42 v_~y~0_68))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_68, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_67, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][250], [111#P0EXITtrue, Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 299#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), P1Thread1of1ForFork1InUse, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 265#true, 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), 45#L808true, Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 281#true, Black: 283#(= ~__unbuffered_cnt~0 0), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 70#L771true, Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 149#true, 108#L827true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), 203#(= ~y$r_buff0_thd0~0 0), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:35,096 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,096 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,096 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,097 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,097 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][400], [111#P0EXITtrue, Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 299#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 107#L801true, Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), P1Thread1of1ForFork1InUse, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 265#true, 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 82#L834true, 281#true, Black: 283#(= ~__unbuffered_cnt~0 0), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), 70#L771true, Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 203#(= ~y$r_buff0_thd0~0 0), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:35,097 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,097 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,097 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,097 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,309 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][244], [Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 113#L756true, Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 107#L801true, Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 82#L834true, Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 283#(= ~__unbuffered_cnt~0 0), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, 70#L771true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 203#(= ~y$r_buff0_thd0~0 0), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 297#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:35,310 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-08-30 16:51:35,310 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-30 16:51:35,310 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-30 16:51:35,310 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-30 16:51:35,322 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L801-->L808: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_102) v_~y$w_buff0_used~0_101) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_20 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$r_buff0_thd3~0_20 (ite .cse3 0 v_~y$r_buff0_thd3~0_21)) (= v_~y~0_67 (ite .cse0 v_~y$w_buff0~0_41 (ite .cse4 v_~y$w_buff1~0_42 v_~y~0_68))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_68, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_67, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][250], [Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 111#P0EXITtrue, 299#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), P1Thread1of1ForFork1InUse, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P0Thread1of1ForFork3InUse, 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 265#true, 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), 45#L808true, Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 283#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, 70#L771true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 149#true, 108#L827true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), 203#(= ~y$r_buff0_thd0~0 0), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:35,326 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,326 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,326 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,326 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,326 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_129 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256)))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_130 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_117)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y~0_85 (ite .cse4 v_~y$w_buff0~0_57 (ite .cse0 v_~y$w_buff1~0_56 v_~y~0_86))) (= v_~y$r_buff0_thd4~0_21 (ite .cse1 0 v_~y$r_buff0_thd4~0_22)) (= v_~y$w_buff0_used~0_129 (ite .cse4 0 v_~y$w_buff0_used~0_130))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_57, ~y~0=v_~y~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][400], [111#P0EXITtrue, Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 299#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), 107#L801true, P1Thread1of1ForFork1InUse, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P0Thread1of1ForFork3InUse, 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 82#L834true, Black: 283#(= ~__unbuffered_cnt~0 0), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, 70#L771true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 203#(= ~y$r_buff0_thd0~0 0), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:35,326 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,327 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,327 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,327 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:35,507 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L771-->L778: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_53 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_24 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_54 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_49 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_23 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_48 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite .cse2 0 v_~y$w_buff0_used~0_54) v_~y$w_buff0_used~0_53) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_49) v_~y$w_buff1_used~0_48) (= v_~y~0_25 (ite .cse2 v_~y$w_buff0~0_13 (ite .cse3 v_~y$w_buff1~0_12 v_~y~0_26))) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_24) v_~y$r_buff0_thd2~0_23)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_54, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_23, ~y~0=v_~y~0_25, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][251], [Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 111#P0EXITtrue, 114#L778true, 299#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 107#L801true, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 265#true, Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 267#(= ~z~0 1), 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 283#(= ~__unbuffered_cnt~0 0), 281#true, Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 108#L827true, 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 203#(= ~y$r_buff0_thd0~0 0), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:35,508 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-30 16:51:35,508 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 16:51:35,508 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 16:51:35,508 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 16:51:35,562 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L771-->L778: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_53 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_24 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_54 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_49 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_23 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_48 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite .cse2 0 v_~y$w_buff0_used~0_54) v_~y$w_buff0_used~0_53) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_49) v_~y$w_buff1_used~0_48) (= v_~y~0_25 (ite .cse2 v_~y$w_buff0~0_13 (ite .cse3 v_~y$w_buff1~0_12 v_~y~0_26))) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_24) v_~y$r_buff0_thd2~0_23)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_54, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_13, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_23, ~y~0=v_~y~0_25, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][251], [Black: 188#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), 111#P0EXITtrue, 114#L778true, 299#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 198#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 107#L801true, 274#(and (= ~z~0 1) (= ~__unbuffered_p2_EAX~0 1)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 284#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 239#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 69#L2true, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (= ~y~0 1)), Black: 206#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))))), Black: 265#true, 231#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 271#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 267#(= ~z~0 1), 257#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= 2 ~y$w_buff0~0)), Black: 151#(= ~x~0 0), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 220#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 283#(= ~__unbuffered_cnt~0 0), Black: 158#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 218#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 222#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 162#true, Black: 164#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 108#L827true, 149#true, 219#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 232#(and (= ~y$r_buff0_thd0~0 0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 203#(= ~y$r_buff0_thd0~0 0), Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0)), Black: 243#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 245#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2023-08-30 16:51:35,563 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-30 16:51:35,563 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 16:51:35,563 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 16:51:35,563 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-30 16:51:36,460 INFO L130 PetriNetUnfolder]: 12990/19759 cut-off events. [2023-08-30 16:51:36,460 INFO L131 PetriNetUnfolder]: For 311817/318482 co-relation queries the response was YES. [2023-08-30 16:51:36,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129324 conditions, 19759 events. 12990/19759 cut-off events. For 311817/318482 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 141168 event pairs, 896 based on Foata normal form. 4999/24115 useless extension candidates. Maximal degree in co-relation 129274. Up to 8919 conditions per place. [2023-08-30 16:51:36,614 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 500 selfloop transitions, 18 changer transitions 83/641 dead transitions. [2023-08-30 16:51:36,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 641 transitions, 12491 flow [2023-08-30 16:51:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:51:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:51:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-08-30 16:51:36,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159386068476978 [2023-08-30 16:51:36,617 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-08-30 16:51:36,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-08-30 16:51:36,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:36,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-08-30 16:51:36,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:36,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:36,621 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:36,621 INFO L175 Difference]: Start difference. First operand has 102 places, 224 transitions, 3683 flow. Second operand 7 states and 874 transitions. [2023-08-30 16:51:36,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 641 transitions, 12491 flow [2023-08-30 16:51:36,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 641 transitions, 11772 flow, removed 54 selfloop flow, removed 7 redundant places. [2023-08-30 16:51:36,986 INFO L231 Difference]: Finished difference. Result has 104 places, 193 transitions, 3002 flow [2023-08-30 16:51:36,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2883, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3002, PETRI_PLACES=104, PETRI_TRANSITIONS=193} [2023-08-30 16:51:36,987 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2023-08-30 16:51:36,987 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 193 transitions, 3002 flow [2023-08-30 16:51:36,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:36,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:36,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:36,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:51:36,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:36,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 226403653, now seen corresponding path program 1 times [2023-08-30 16:51:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663404068] [2023-08-30 16:51:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:37,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663404068] [2023-08-30 16:51:37,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663404068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759199579] [2023-08-30 16:51:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:37,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:37,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 242 [2023-08-30 16:51:37,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 193 transitions, 3002 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:37,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:37,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 242 [2023-08-30 16:51:37,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:40,719 INFO L130 PetriNetUnfolder]: 18750/28790 cut-off events. [2023-08-30 16:51:40,719 INFO L131 PetriNetUnfolder]: For 299765/301268 co-relation queries the response was YES. [2023-08-30 16:51:40,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193194 conditions, 28790 events. 18750/28790 cut-off events. For 299765/301268 co-relation queries the response was YES. Maximal size of possible extension queue 1433. Compared 206585 event pairs, 4989 based on Foata normal form. 1295/30012 useless extension candidates. Maximal degree in co-relation 193143. Up to 14708 conditions per place. [2023-08-30 16:51:40,891 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 117 selfloop transitions, 25 changer transitions 117/263 dead transitions. [2023-08-30 16:51:40,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 263 transitions, 4243 flow [2023-08-30 16:51:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-30 16:51:40,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490702479338843 [2023-08-30 16:51:40,893 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-30 16:51:40,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-30 16:51:40,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:40,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-30 16:51:40,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:40,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:40,896 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:40,896 INFO L175 Difference]: Start difference. First operand has 104 places, 193 transitions, 3002 flow. Second operand 4 states and 475 transitions. [2023-08-30 16:51:40,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 263 transitions, 4243 flow [2023-08-30 16:51:43,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 263 transitions, 4133 flow, removed 34 selfloop flow, removed 4 redundant places. [2023-08-30 16:51:43,141 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 1619 flow [2023-08-30 16:51:43,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2942, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1619, PETRI_PLACES=104, PETRI_TRANSITIONS=112} [2023-08-30 16:51:43,141 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2023-08-30 16:51:43,141 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 1619 flow [2023-08-30 16:51:43,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:43,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:43,142 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] [2023-08-30 16:51:43,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 16:51:43,142 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:43,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2054188906, now seen corresponding path program 1 times [2023-08-30 16:51:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:43,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761908727] [2023-08-30 16:51:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:43,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:43,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:43,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761908727] [2023-08-30 16:51:43,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761908727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:43,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:43,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753516206] [2023-08-30 16:51:43,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:43,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:43,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:51:43,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 1619 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:43,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:43,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:51:43,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:44,346 INFO L130 PetriNetUnfolder]: 5163/8554 cut-off events. [2023-08-30 16:51:44,346 INFO L131 PetriNetUnfolder]: For 110862/112275 co-relation queries the response was YES. [2023-08-30 16:51:44,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52468 conditions, 8554 events. 5163/8554 cut-off events. For 110862/112275 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 60272 event pairs, 568 based on Foata normal form. 1511/9849 useless extension candidates. Maximal degree in co-relation 52417. Up to 3664 conditions per place. [2023-08-30 16:51:44,391 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 192 selfloop transitions, 18 changer transitions 46/276 dead transitions. [2023-08-30 16:51:44,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 276 transitions, 4429 flow [2023-08-30 16:51:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:51:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:51:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-08-30 16:51:44,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165289256198347 [2023-08-30 16:51:44,394 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-08-30 16:51:44,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-08-30 16:51:44,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:44,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-08-30 16:51:44,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,397 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,398 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 1619 flow. Second operand 7 states and 875 transitions. [2023-08-30 16:51:44,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 276 transitions, 4429 flow [2023-08-30 16:51:44,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 276 transitions, 4273 flow, removed 49 selfloop flow, removed 7 redundant places. [2023-08-30 16:51:44,513 INFO L231 Difference]: Finished difference. Result has 102 places, 114 transitions, 1542 flow [2023-08-30 16:51:44,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1542, PETRI_PLACES=102, PETRI_TRANSITIONS=114} [2023-08-30 16:51:44,513 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2023-08-30 16:51:44,514 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 114 transitions, 1542 flow [2023-08-30 16:51:44,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:44,514 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] [2023-08-30 16:51:44,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 16:51:44,514 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:44,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash -528275953, now seen corresponding path program 1 times [2023-08-30 16:51:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:44,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671375486] [2023-08-30 16:51:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:44,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:44,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671375486] [2023-08-30 16:51:44,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671375486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:44,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:44,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:51:44,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139323198] [2023-08-30 16:51:44,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:44,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:51:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:44,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:51:44,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:51:44,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:51:44,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 114 transitions, 1542 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:44,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:51:44,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:45,561 INFO L130 PetriNetUnfolder]: 4811/7856 cut-off events. [2023-08-30 16:51:45,561 INFO L131 PetriNetUnfolder]: For 76088/77005 co-relation queries the response was YES. [2023-08-30 16:51:45,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49813 conditions, 7856 events. 4811/7856 cut-off events. For 76088/77005 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 53975 event pairs, 534 based on Foata normal form. 708/8367 useless extension candidates. Maximal degree in co-relation 49764. Up to 3400 conditions per place. [2023-08-30 16:51:45,604 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 147 selfloop transitions, 22 changer transitions 85/267 dead transitions. [2023-08-30 16:51:45,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 267 transitions, 4158 flow [2023-08-30 16:51:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:51:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:51:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1098 transitions. [2023-08-30 16:51:45,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041322314049587 [2023-08-30 16:51:45,607 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1098 transitions. [2023-08-30 16:51:45,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1098 transitions. [2023-08-30 16:51:45,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:45,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1098 transitions. [2023-08-30 16:51:45,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:45,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:45,611 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:45,611 INFO L175 Difference]: Start difference. First operand has 102 places, 114 transitions, 1542 flow. Second operand 9 states and 1098 transitions. [2023-08-30 16:51:45,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 267 transitions, 4158 flow [2023-08-30 16:51:45,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 267 transitions, 3904 flow, removed 59 selfloop flow, removed 6 redundant places. [2023-08-30 16:51:45,967 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 1060 flow [2023-08-30 16:51:45,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1060, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2023-08-30 16:51:45,967 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2023-08-30 16:51:45,968 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 1060 flow [2023-08-30 16:51:45,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:45,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:45,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:45,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 16:51:45,968 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:45,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash -675384658, now seen corresponding path program 1 times [2023-08-30 16:51:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119930204] [2023-08-30 16:51:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:46,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:46,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119930204] [2023-08-30 16:51:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119930204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:46,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465609691] [2023-08-30 16:51:46,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:46,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:46,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:46,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:46,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-30 16:51:46,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 1060 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:46,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-30 16:51:46,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:46,400 INFO L130 PetriNetUnfolder]: 1645/2764 cut-off events. [2023-08-30 16:51:46,400 INFO L131 PetriNetUnfolder]: For 21307/21438 co-relation queries the response was YES. [2023-08-30 16:51:46,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16491 conditions, 2764 events. 1645/2764 cut-off events. For 21307/21438 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15163 event pairs, 379 based on Foata normal form. 106/2853 useless extension candidates. Maximal degree in co-relation 16453. Up to 1669 conditions per place. [2023-08-30 16:51:46,412 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 57 selfloop transitions, 1 changer transitions 95/157 dead transitions. [2023-08-30 16:51:46,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 157 transitions, 2113 flow [2023-08-30 16:51:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-08-30 16:51:46,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196280991735537 [2023-08-30 16:51:46,414 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-08-30 16:51:46,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-08-30 16:51:46,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:46,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-08-30 16:51:46,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,416 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,416 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 1060 flow. Second operand 4 states and 503 transitions. [2023-08-30 16:51:46,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 157 transitions, 2113 flow [2023-08-30 16:51:46,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 157 transitions, 1809 flow, removed 81 selfloop flow, removed 15 redundant places. [2023-08-30 16:51:46,459 INFO L231 Difference]: Finished difference. Result has 94 places, 54 transitions, 493 flow [2023-08-30 16:51:46,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=493, PETRI_PLACES=94, PETRI_TRANSITIONS=54} [2023-08-30 16:51:46,460 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2023-08-30 16:51:46,460 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 54 transitions, 493 flow [2023-08-30 16:51:46,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:46,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:46,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 16:51:46,461 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:46,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1468654342, now seen corresponding path program 2 times [2023-08-30 16:51:46,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:46,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052654276] [2023-08-30 16:51:46,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:46,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:46,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052654276] [2023-08-30 16:51:46,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052654276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:46,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:46,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:46,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677722996] [2023-08-30 16:51:46,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:46,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:46,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:46,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:51:46,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 54 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:46,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:51:46,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:47,117 INFO L130 PetriNetUnfolder]: 348/619 cut-off events. [2023-08-30 16:51:47,117 INFO L131 PetriNetUnfolder]: For 3230/3232 co-relation queries the response was YES. [2023-08-30 16:51:47,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3333 conditions, 619 events. 348/619 cut-off events. For 3230/3232 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2440 event pairs, 99 based on Foata normal form. 1/618 useless extension candidates. Maximal degree in co-relation 3302. Up to 451 conditions per place. [2023-08-30 16:51:47,120 INFO L137 encePairwiseOnDemand]: 237/242 looper letters, 52 selfloop transitions, 11 changer transitions 8/74 dead transitions. [2023-08-30 16:51:47,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 74 transitions, 769 flow [2023-08-30 16:51:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-08-30 16:51:47,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506198347107438 [2023-08-30 16:51:47,122 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-08-30 16:51:47,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-08-30 16:51:47,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:47,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-08-30 16:51:47,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:47,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:47,124 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:47,124 INFO L175 Difference]: Start difference. First operand has 94 places, 54 transitions, 493 flow. Second operand 4 states and 490 transitions. [2023-08-30 16:51:47,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 74 transitions, 769 flow [2023-08-30 16:51:47,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 631 flow, removed 27 selfloop flow, removed 23 redundant places. [2023-08-30 16:51:47,130 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 399 flow [2023-08-30 16:51:47,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-08-30 16:51:47,130 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-30 16:51:47,130 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 399 flow [2023-08-30 16:51:47,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:47,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:47,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:47,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 16:51:47,131 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:47,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash 974524206, now seen corresponding path program 3 times [2023-08-30 16:51:47,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:47,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125331889] [2023-08-30 16:51:47,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:47,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125331889] [2023-08-30 16:51:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125331889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:48,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:48,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:51:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866117624] [2023-08-30 16:51:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:48,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:51:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:51:48,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:51:48,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:51:48,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 399 flow. Second operand has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:48,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:51:48,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:48,306 INFO L130 PetriNetUnfolder]: 368/664 cut-off events. [2023-08-30 16:51:48,306 INFO L131 PetriNetUnfolder]: For 2069/2073 co-relation queries the response was YES. [2023-08-30 16:51:48,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 664 events. 368/664 cut-off events. For 2069/2073 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2699 event pairs, 29 based on Foata normal form. 1/661 useless extension candidates. Maximal degree in co-relation 3135. Up to 324 conditions per place. [2023-08-30 16:51:48,308 INFO L137 encePairwiseOnDemand]: 237/242 looper letters, 54 selfloop transitions, 9 changer transitions 23/89 dead transitions. [2023-08-30 16:51:48,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 773 flow [2023-08-30 16:51:48,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:51:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:51:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions. [2023-08-30 16:51:48,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49104683195592286 [2023-08-30 16:51:48,310 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 713 transitions. [2023-08-30 16:51:48,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 713 transitions. [2023-08-30 16:51:48,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:48,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 713 transitions. [2023-08-30 16:51:48,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,312 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,312 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 399 flow. Second operand 6 states and 713 transitions. [2023-08-30 16:51:48,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 773 flow [2023-08-30 16:51:48,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 744 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:48,317 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 357 flow [2023-08-30 16:51:48,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=357, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2023-08-30 16:51:48,319 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-08-30 16:51:48,319 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 357 flow [2023-08-30 16:51:48,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:48,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:48,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 16:51:48,319 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:48,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash -95805658, now seen corresponding path program 4 times [2023-08-30 16:51:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:48,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518804315] [2023-08-30 16:51:48,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:51:48,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:51:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:51:48,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:51:48,406 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:51:48,407 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:51:48,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:51:48,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:51:48,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:51:48,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:51:48,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:51:48,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:51:48,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 16:51:48,413 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:48,417 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:51:48,417 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:51:48,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:51:48 BasicIcfg [2023-08-30 16:51:48,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:51:48,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:51:48,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:51:48,498 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:51:48,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:51" (3/4) ... [2023-08-30 16:51:48,500 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:51:48,556 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:51:48,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:51:48,557 INFO L158 Benchmark]: Toolchain (without parser) took 58453.73ms. Allocated memory was 98.6MB in the beginning and 10.2GB in the end (delta: 10.1GB). Free memory was 74.5MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2023-08-30 16:51:48,557 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:51:48,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.65ms. Allocated memory is still 98.6MB. Free memory was 74.2MB in the beginning and 74.1MB in the end (delta: 102.7kB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-08-30 16:51:48,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.79ms. Allocated memory is still 98.6MB. Free memory was 74.1MB in the beginning and 71.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:51:48,558 INFO L158 Benchmark]: Boogie Preprocessor took 39.78ms. Allocated memory is still 98.6MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:51:48,558 INFO L158 Benchmark]: RCFGBuilder took 630.49ms. Allocated memory is still 98.6MB. Free memory was 69.4MB in the beginning and 71.9MB in the end (delta: -2.5MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2023-08-30 16:51:48,558 INFO L158 Benchmark]: TraceAbstraction took 57134.93ms. Allocated memory was 98.6MB in the beginning and 10.2GB in the end (delta: 10.1GB). Free memory was 70.7MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2023-08-30 16:51:48,558 INFO L158 Benchmark]: Witness Printer took 58.49ms. Allocated memory is still 10.2GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:51:48,559 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.16ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.65ms. Allocated memory is still 98.6MB. Free memory was 74.2MB in the beginning and 74.1MB in the end (delta: 102.7kB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.79ms. Allocated memory is still 98.6MB. Free memory was 74.1MB in the beginning and 71.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.78ms. Allocated memory is still 98.6MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 630.49ms. Allocated memory is still 98.6MB. Free memory was 69.4MB in the beginning and 71.9MB in the end (delta: -2.5MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * TraceAbstraction took 57134.93ms. Allocated memory was 98.6MB in the beginning and 10.2GB in the end (delta: 10.1GB). Free memory was 70.7MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 58.49ms. Allocated memory is still 10.2GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 138 PlacesBefore, 42 PlacesAfterwards, 127 TransitionsBefore, 29 TransitionsAfterwards, 3090 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 TotalNumberOfCompositions, 7976 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3235, independent: 3013, independent conditional: 0, independent unconditional: 3013, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1658, independent: 1613, independent conditional: 0, independent unconditional: 1613, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3235, independent: 1400, independent conditional: 0, independent unconditional: 1400, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 1658, unknown conditional: 0, unknown unconditional: 1658] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1081, ((void *)0), P0, ((void *)0))=-3, t1081={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1082, ((void *)0), P1, ((void *)0))=-2, t1081={5:0}, t1082={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1083, ((void *)0), P2, ((void *)0))=-1, t1081={5:0}, t1082={6:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t1084; [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1084, ((void *)0), P3, ((void *)0))=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L820] 4 a = 1 [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 854]: 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: 852]: 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: 858]: 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: 856]: 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, 168 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: 57.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 44.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1245 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 618 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 380 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3047 IncrementalHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 238 mSDtfsCounter, 3047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4385occurred in iteration=14, InterpolantAutomatonStates: 114, 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, 7.4s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 4658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:51:48,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE