/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:39:09,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:39:09,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:39:09,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:39:09,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:39:09,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:39:09,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:39:09,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:39:09,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:39:09,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:39:09,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:39:09,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:39:09,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:39:09,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:39:09,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:39:09,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:39:09,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:39:09,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:39:09,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:39:09,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:39:09,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:39:09,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:39:09,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:39:09,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:39:09,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:39:09,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:39:09,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:39:09,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:39:09,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:39:09,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:39:09,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:39:09,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:39:09,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:39:09,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:39:09,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:39:09,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:39:09,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:39:09,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:39:09,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:39:09,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:39:09,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:39:09,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 22:39:09,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:39:09,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:39:09,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:39:09,367 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:39:09,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:39:09,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:39:09,368 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:39:09,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:39:09,368 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:39:09,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:39:09,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:39:09,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:39:09,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:39:09,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:39:09,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:39:09,370 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:39:09,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:39:09,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:39:09,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:39:09,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:39:09,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:39:09,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:39:09,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:39:09,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:39:09,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:39:09,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:39:09,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:39:09,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:39:09,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:39:09,373 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:39:09,373 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:39:09,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-18 22:39:09,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:39:09,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:39:09,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:39:09,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:39:09,634 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:39:09,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i [2022-01-18 22:39:09,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4efe3b68/d83711afbbb246c2abe2d3896fe8ad6b/FLAGa891cd154 [2022-01-18 22:39:10,141 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:39:10,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i [2022-01-18 22:39:10,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4efe3b68/d83711afbbb246c2abe2d3896fe8ad6b/FLAGa891cd154 [2022-01-18 22:39:10,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4efe3b68/d83711afbbb246c2abe2d3896fe8ad6b [2022-01-18 22:39:10,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:39:10,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:39:10,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:39:10,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:39:10,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:39:10,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7837adf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10, skipping insertion in model container [2022-01-18 22:39:10,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:39:10,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:39:10,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2022-01-18 22:39:10,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:39:10,508 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:39:10,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2022-01-18 22:39:10,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:39:10,580 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:39:10,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10 WrapperNode [2022-01-18 22:39:10,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:39:10,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:39:10,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:39:10,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:39:10,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,638 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-01-18 22:39:10,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:39:10,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:39:10,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:39:10,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:39:10,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:39:10,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:39:10,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:39:10,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:39:10,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (1/1) ... [2022-01-18 22:39:10,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:39:10,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:39:10,731 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) [2022-01-18 22:39:10,747 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 [2022-01-18 22:39:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:39:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:39:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:39:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:39:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:39:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:39:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:39:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:39:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:39:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:39:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:39:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:39:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:39:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:39:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:39:10,775 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:39:10,870 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:39:10,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:39:11,399 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:39:11,642 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:39:11,642 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:39:11,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:39:11 BoogieIcfgContainer [2022-01-18 22:39:11,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:39:11,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:39:11,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:39:11,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:39:11,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:39:10" (1/3) ... [2022-01-18 22:39:11,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4318ce23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:39:11, skipping insertion in model container [2022-01-18 22:39:11,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:39:10" (2/3) ... [2022-01-18 22:39:11,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4318ce23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:39:11, skipping insertion in model container [2022-01-18 22:39:11,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:39:11" (3/3) ... [2022-01-18 22:39:11,653 INFO L111 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2022-01-18 22:39:11,657 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:39:11,657 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:39:11,658 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:39:11,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,698 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,698 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,698 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,698 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,699 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,700 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,701 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,702 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,708 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,708 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,708 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,708 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,709 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,710 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,711 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,711 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,711 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,711 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,711 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,711 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,711 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,712 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,712 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,712 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,712 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,712 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,712 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,712 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,717 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,718 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,718 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,718 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,718 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,718 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,718 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,718 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,719 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,720 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,720 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,720 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,720 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,720 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,720 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,721 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,722 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,723 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,723 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,723 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,723 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,723 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,723 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,723 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,724 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,724 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,725 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,725 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,725 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,725 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,725 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,725 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,725 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,725 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,726 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,726 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,726 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,726 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,726 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,728 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,728 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,728 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,728 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,730 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,730 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,731 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,731 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,731 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,731 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,731 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,731 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,732 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,732 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,732 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,732 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,733 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,733 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,733 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,733 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,733 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,734 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,735 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,735 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,735 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,735 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,735 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,735 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,736 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:39:11,739 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:39:11,787 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:39:11,796 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 22:39:11,796 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-18 22:39:11,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-01-18 22:39:11,863 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2022-01-18 22:39:11,864 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:39:11,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-01-18 22:39:11,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2022-01-18 22:39:11,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2022-01-18 22:39:11,888 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2022-01-18 22:39:11,888 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:39:11,888 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:11,888 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:11,889 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1958117325, now seen corresponding path program 1 times [2022-01-18 22:39:11,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:11,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202520379] [2022-01-18 22:39:11,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:11,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:39:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:39:12,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:39:12,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202520379] [2022-01-18 22:39:12,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202520379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:39:12,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:39:12,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:39:12,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439715799] [2022-01-18 22:39:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:39:12,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:39:12,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:39:12,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:39:12,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:39:12,257 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 116 [2022-01-18 22:39:12,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:12,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:39:12,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 116 [2022-01-18 22:39:12,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:39:12,399 INFO L129 PetriNetUnfolder]: 37/224 cut-off events. [2022-01-18 22:39:12,399 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-18 22:39:12,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 224 events. 37/224 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 705 event pairs, 7 based on Foata normal form. 13/221 useless extension candidates. Maximal degree in co-relation 264. Up to 51 conditions per place. [2022-01-18 22:39:12,404 INFO L132 encePairwiseOnDemand]: 111/116 looper letters, 11 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-01-18 22:39:12,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 113 transitions, 264 flow [2022-01-18 22:39:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:39:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:39:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-01-18 22:39:12,421 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9396551724137931 [2022-01-18 22:39:12,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-01-18 22:39:12,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-01-18 22:39:12,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:39:12,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-01-18 22:39:12,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:12,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:12,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:12,438 INFO L186 Difference]: Start difference. First operand has 121 places, 113 transitions, 235 flow. Second operand 3 states and 327 transitions. [2022-01-18 22:39:12,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 113 transitions, 264 flow [2022-01-18 22:39:12,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 260 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 22:39:12,445 INFO L242 Difference]: Finished difference. Result has 118 places, 109 transitions, 228 flow [2022-01-18 22:39:12,446 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2022-01-18 22:39:12,449 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places. [2022-01-18 22:39:12,449 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 228 flow [2022-01-18 22:39:12,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:12,450 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:12,450 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:12,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:39:12,450 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash -566480303, now seen corresponding path program 1 times [2022-01-18 22:39:12,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:12,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122912156] [2022-01-18 22:39:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:12,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:39:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:39:12,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:39:12,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122912156] [2022-01-18 22:39:12,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122912156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:39:12,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:39:12,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:39:12,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039803531] [2022-01-18 22:39:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:39:12,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:39:12,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:39:12,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:39:12,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:39:12,685 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2022-01-18 22:39:12,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:12,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:39:12,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2022-01-18 22:39:12,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:39:13,557 INFO L129 PetriNetUnfolder]: 1304/3562 cut-off events. [2022-01-18 22:39:13,558 INFO L130 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-01-18 22:39:13,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5769 conditions, 3562 events. 1304/3562 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 30189 event pairs, 242 based on Foata normal form. 0/3447 useless extension candidates. Maximal degree in co-relation 5713. Up to 924 conditions per place. [2022-01-18 22:39:13,638 INFO L132 encePairwiseOnDemand]: 104/116 looper letters, 29 selfloop transitions, 8 changer transitions 70/182 dead transitions. [2022-01-18 22:39:13,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 584 flow [2022-01-18 22:39:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:39:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:39:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 899 transitions. [2022-01-18 22:39:13,642 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2022-01-18 22:39:13,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 899 transitions. [2022-01-18 22:39:13,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 899 transitions. [2022-01-18 22:39:13,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:39:13,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 899 transitions. [2022-01-18 22:39:13,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.88888888888889) internal successors, (899), 9 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:13,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:13,649 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:13,649 INFO L186 Difference]: Start difference. First operand has 118 places, 109 transitions, 228 flow. Second operand 9 states and 899 transitions. [2022-01-18 22:39:13,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 584 flow [2022-01-18 22:39:13,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 182 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:39:13,654 INFO L242 Difference]: Finished difference. Result has 132 places, 102 transitions, 296 flow [2022-01-18 22:39:13,654 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=132, PETRI_TRANSITIONS=102} [2022-01-18 22:39:13,655 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 11 predicate places. [2022-01-18 22:39:13,655 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 102 transitions, 296 flow [2022-01-18 22:39:13,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:13,655 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:13,655 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:13,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:39:13,656 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash -180533774, now seen corresponding path program 1 times [2022-01-18 22:39:13,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:13,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179104595] [2022-01-18 22:39:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:13,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:39:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:39:13,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:39:13,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179104595] [2022-01-18 22:39:13,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179104595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:39:13,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:39:13,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:39:13,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592163707] [2022-01-18 22:39:13,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:39:13,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:39:13,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:39:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:39:13,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:39:13,768 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 116 [2022-01-18 22:39:13,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 102 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 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) [2022-01-18 22:39:13,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:39:13,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 116 [2022-01-18 22:39:13,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:39:14,229 INFO L129 PetriNetUnfolder]: 685/1574 cut-off events. [2022-01-18 22:39:14,229 INFO L130 PetriNetUnfolder]: For 2516/2610 co-relation queries the response was YES. [2022-01-18 22:39:14,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4536 conditions, 1574 events. 685/1574 cut-off events. For 2516/2610 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10693 event pairs, 179 based on Foata normal form. 75/1562 useless extension candidates. Maximal degree in co-relation 4471. Up to 507 conditions per place. [2022-01-18 22:39:14,244 INFO L132 encePairwiseOnDemand]: 110/116 looper letters, 20 selfloop transitions, 3 changer transitions 40/147 dead transitions. [2022-01-18 22:39:14,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 650 flow [2022-01-18 22:39:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:39:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:39:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 908 transitions. [2022-01-18 22:39:14,251 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8697318007662835 [2022-01-18 22:39:14,251 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 908 transitions. [2022-01-18 22:39:14,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 908 transitions. [2022-01-18 22:39:14,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:39:14,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 908 transitions. [2022-01-18 22:39:14,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.88888888888889) internal successors, (908), 9 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:14,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:14,257 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:14,257 INFO L186 Difference]: Start difference. First operand has 132 places, 102 transitions, 296 flow. Second operand 9 states and 908 transitions. [2022-01-18 22:39:14,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 650 flow [2022-01-18 22:39:14,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 147 transitions, 598 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-01-18 22:39:14,271 INFO L242 Difference]: Finished difference. Result has 127 places, 102 transitions, 295 flow [2022-01-18 22:39:14,271 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=295, PETRI_PLACES=127, PETRI_TRANSITIONS=102} [2022-01-18 22:39:14,272 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 6 predicate places. [2022-01-18 22:39:14,272 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 102 transitions, 295 flow [2022-01-18 22:39:14,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 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) [2022-01-18 22:39:14,272 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:14,273 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:14,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:39:14,273 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:14,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash 122241685, now seen corresponding path program 1 times [2022-01-18 22:39:14,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:14,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155573627] [2022-01-18 22:39:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:14,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:39:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:39:14,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:39:14,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155573627] [2022-01-18 22:39:14,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155573627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:39:14,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:39:14,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:39:14,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920249613] [2022-01-18 22:39:14,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:39:14,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:39:14,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:39:14,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:39:14,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:39:14,439 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-01-18 22:39:14,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 102 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:14,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:39:14,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-01-18 22:39:14,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:39:14,859 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][110], [75#L4true, 9#L763true, 191#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, 68#P1ENTRYtrue, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:14,859 INFO L384 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-01-18 22:39:14,859 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-01-18 22:39:14,859 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-01-18 22:39:14,859 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-01-18 22:39:14,901 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][95], [9#L763true, 189#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 59#L3true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 93#L784true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:14,902 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,902 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,902 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,902 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,905 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][110], [9#L763true, 80#L4-1true, 191#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, 68#P1ENTRYtrue, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:14,905 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,905 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,905 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,905 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,906 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [75#L4true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 57#L768true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, 68#P1ENTRYtrue, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:14,906 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,906 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,906 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,906 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-18 22:39:14,950 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][110], [75#L4true, 9#L763true, 191#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 93#L784true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:14,950 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,950 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,950 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,950 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,951 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][127], [193#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 59#L3true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), 57#L768true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 93#L784true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:14,951 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,951 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,951 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,951 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,953 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [80#L4-1true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 57#L768true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, 68#P1ENTRYtrue, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:14,953 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,953 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,953 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-18 22:39:14,953 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-18 22:39:15,002 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][110], [9#L763true, 80#L4-1true, 191#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 93#L784true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,002 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-01-18 22:39:15,002 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-18 22:39:15,002 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-18 22:39:15,002 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-18 22:39:15,003 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [75#L4true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), 57#L768true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 93#L784true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,003 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-01-18 22:39:15,003 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-18 22:39:15,003 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-18 22:39:15,003 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-18 22:39:15,052 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [80#L4-1true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), 57#L768true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 93#L784true, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,052 INFO L384 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-01-18 22:39:15,052 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-18 22:39:15,052 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-18 22:39:15,053 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-18 22:39:15,061 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [59#L3true, 102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 57#L768true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), 156#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 180#true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,062 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-18 22:39:15,062 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-18 22:39:15,062 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-18 22:39:15,062 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-18 22:39:15,086 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [75#L4true, 9#L763true, 102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 180#true, Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,086 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-18 22:39:15,086 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-18 22:39:15,086 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-18 22:39:15,086 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-18 22:39:15,096 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [75#L4true, 102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 57#L768true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), 156#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 180#true, 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,096 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,096 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,096 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,096 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,118 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [9#L763true, 102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 115#L3-1true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 180#true, Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,118 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,118 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,118 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,118 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,118 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][143], [9#L763true, 80#L4-1true, 102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), 185#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,119 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,119 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,119 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,119 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,119 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [75#L4true, 102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), 57#L768true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 180#true, Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,119 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,120 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,120 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,120 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,120 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-18 22:39:15,127 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 57#L768true, 115#L3-1true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), 156#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 180#true, Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,127 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,127 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,127 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,127 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,127 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][143], [80#L4-1true, 102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 57#L768true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), 156#true, 185#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 21#L817true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,127 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,128 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,128 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,128 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,142 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), 57#L768true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 115#L3-1true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 180#true, Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,143 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,143 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,143 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,143 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,143 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,144 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][143], [80#L4-1true, 102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), 57#L768true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, 185#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,144 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,144 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,144 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,144 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,144 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-18 22:39:15,158 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [9#L763true, 102#L797true, 105#L850true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 180#true, Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,158 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-18 22:39:15,158 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-18 22:39:15,158 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-18 22:39:15,158 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-18 22:39:15,158 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([868] L850-->L853: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_3 2) (= v_~__unbuffered_p0_EAX~0_3 0) (= v_~__unbuffered_p2_EBX~0_3 0) (= 2 v_~y~0_5))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~y~0=v_~y~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~y~0=v_~y~0_5} AuxVars[] AssignedVars[~main$tmp_guard1~0][155], [9#L763true, 102#L797true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), 27#L810true, Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 180#true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 45#L853true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,158 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-18 22:39:15,159 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-18 22:39:15,159 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-18 22:39:15,159 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-18 22:39:15,161 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [102#L797true, 105#L850true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 57#L768true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), 156#true, Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 180#true, Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P0Thread1of1ForFork2InUse, Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,161 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-18 22:39:15,161 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-18 22:39:15,162 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-18 22:39:15,162 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-18 22:39:15,172 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([899] L810-->L817: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_293 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_62 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_210 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd3~0_70 256) 0)) (.cse14 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (let ((.cse7 (not .cse14)) (.cse6 (or .cse14 .cse12)) (.cse3 (not .cse13)) (.cse0 (or .cse13 .cse11)) (.cse2 (not .cse11)) (.cse4 (not .cse10)) (.cse5 (not .cse12)) (.cse1 (or .cse10 .cse12))) (and (or (and .cse0 .cse1 (= v_~x$w_buff1_used~0_210 v_~x$w_buff1_used~0_209)) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~x$w_buff1_used~0_209 0))) (or (and (= v_~x$w_buff0_used~0_294 v_~x$w_buff0_used~0_293) .cse6) (and (= v_~x$w_buff0_used~0_293 0) .cse7 .cse5)) (or (and .cse7 (= v_~x~0_80 v_~x$w_buff0~0_57) .cse5 (= |v_P2_#t~ite32_31| |v_P2Thread1of1ForFork1_#t~ite32_1|)) (and (= |v_P2_#t~ite32_31| v_~x~0_80) .cse6 (or (and (= |v_P2_#t~ite32_31| v_~x$w_buff1~0_50) .cse2 .cse3) (and .cse0 (= |v_P2_#t~ite32_31| v_~x~0_81))))) (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_69 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_209 256) 0))) (or (and (or (and (not .cse8) .cse2) (and .cse4 (not .cse9))) (= v_~x$r_buff1_thd3~0_61 0)) (and (or .cse9 .cse10) (or .cse11 .cse8) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff1_thd3~0_61)))) (or (and .cse4 (= v_~x$r_buff0_thd3~0_69 0) .cse5) (and .cse1 (= v_~x$r_buff0_thd3~0_70 v_~x$r_buff0_thd3~0_69)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_57, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_70, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_2|, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~x~0=v_~x~0_80} AuxVars[|v_P2_#t~ite32_31|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, P2Thread1of1ForFork1_#t~ite33, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [102#L797true, 105#L850true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), 57#L768true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(= ~__unbuffered_p2_EAX~0 0), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 156#true, Black: 140#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 180#true, Black: 133#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 21#L817true, P0Thread1of1ForFork2InUse, Black: 144#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 142#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-01-18 22:39:15,172 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-18 22:39:15,172 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-18 22:39:15,172 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-18 22:39:15,172 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-18 22:39:15,172 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-18 22:39:15,211 INFO L129 PetriNetUnfolder]: 1945/3960 cut-off events. [2022-01-18 22:39:15,212 INFO L130 PetriNetUnfolder]: For 3002/3488 co-relation queries the response was YES. [2022-01-18 22:39:15,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8992 conditions, 3960 events. 1945/3960 cut-off events. For 3002/3488 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 30586 event pairs, 149 based on Foata normal form. 0/3686 useless extension candidates. Maximal degree in co-relation 8922. Up to 1008 conditions per place. [2022-01-18 22:39:15,243 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 37 selfloop transitions, 7 changer transitions 43/169 dead transitions. [2022-01-18 22:39:15,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 169 transitions, 677 flow [2022-01-18 22:39:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:39:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:39:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1011 transitions. [2022-01-18 22:39:15,246 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.871551724137931 [2022-01-18 22:39:15,246 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1011 transitions. [2022-01-18 22:39:15,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1011 transitions. [2022-01-18 22:39:15,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:39:15,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1011 transitions. [2022-01-18 22:39:15,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.1) internal successors, (1011), 10 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:15,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:15,252 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:15,252 INFO L186 Difference]: Start difference. First operand has 127 places, 102 transitions, 295 flow. Second operand 10 states and 1011 transitions. [2022-01-18 22:39:15,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 169 transitions, 677 flow [2022-01-18 22:39:15,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 169 transitions, 649 flow, removed 11 selfloop flow, removed 11 redundant places. [2022-01-18 22:39:15,264 INFO L242 Difference]: Finished difference. Result has 125 places, 106 transitions, 329 flow [2022-01-18 22:39:15,265 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=329, PETRI_PLACES=125, PETRI_TRANSITIONS=106} [2022-01-18 22:39:15,266 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 4 predicate places. [2022-01-18 22:39:15,266 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 106 transitions, 329 flow [2022-01-18 22:39:15,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:15,267 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:15,267 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:15,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:39:15,267 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:15,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1675924850, now seen corresponding path program 1 times [2022-01-18 22:39:15,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:15,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670080246] [2022-01-18 22:39:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:15,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:39:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:39:15,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:39:15,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670080246] [2022-01-18 22:39:15,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670080246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:39:15,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:39:15,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:39:15,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946403050] [2022-01-18 22:39:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:39:15,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:39:15,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:39:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:39:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:39:15,428 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-01-18 22:39:15,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 106 transitions, 329 flow. Second operand has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:15,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:39:15,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-01-18 22:39:15,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:39:15,901 INFO L129 PetriNetUnfolder]: 847/2156 cut-off events. [2022-01-18 22:39:15,901 INFO L130 PetriNetUnfolder]: For 3009/3140 co-relation queries the response was YES. [2022-01-18 22:39:15,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6268 conditions, 2156 events. 847/2156 cut-off events. For 3009/3140 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16923 event pairs, 69 based on Foata normal form. 65/2150 useless extension candidates. Maximal degree in co-relation 6200. Up to 514 conditions per place. [2022-01-18 22:39:15,917 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 49 selfloop transitions, 18 changer transitions 30/179 dead transitions. [2022-01-18 22:39:15,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 179 transitions, 904 flow [2022-01-18 22:39:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:39:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:39:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1113 transitions. [2022-01-18 22:39:15,921 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.872257053291536 [2022-01-18 22:39:15,921 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1113 transitions. [2022-01-18 22:39:15,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1113 transitions. [2022-01-18 22:39:15,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:39:15,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1113 transitions. [2022-01-18 22:39:15,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:15,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:15,927 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:15,927 INFO L186 Difference]: Start difference. First operand has 125 places, 106 transitions, 329 flow. Second operand 11 states and 1113 transitions. [2022-01-18 22:39:15,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 179 transitions, 904 flow [2022-01-18 22:39:15,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 179 transitions, 888 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-01-18 22:39:15,939 INFO L242 Difference]: Finished difference. Result has 133 places, 121 transitions, 506 flow [2022-01-18 22:39:15,940 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=506, PETRI_PLACES=133, PETRI_TRANSITIONS=121} [2022-01-18 22:39:15,942 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 12 predicate places. [2022-01-18 22:39:15,943 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 121 transitions, 506 flow [2022-01-18 22:39:15,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:15,943 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:15,944 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:15,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:39:15,944 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash 393136652, now seen corresponding path program 1 times [2022-01-18 22:39:15,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:15,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794053710] [2022-01-18 22:39:15,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:15,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:39:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:39:16,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:39:16,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794053710] [2022-01-18 22:39:16,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794053710] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:39:16,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:39:16,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:39:16,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666767803] [2022-01-18 22:39:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:39:16,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:39:16,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:39:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:39:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:39:16,101 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-01-18 22:39:16,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 121 transitions, 506 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:16,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:39:16,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-01-18 22:39:16,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:39:16,508 INFO L129 PetriNetUnfolder]: 405/1998 cut-off events. [2022-01-18 22:39:16,508 INFO L130 PetriNetUnfolder]: For 4242/4591 co-relation queries the response was YES. [2022-01-18 22:39:16,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5929 conditions, 1998 events. 405/1998 cut-off events. For 4242/4591 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19313 event pairs, 52 based on Foata normal form. 18/1905 useless extension candidates. Maximal degree in co-relation 5855. Up to 536 conditions per place. [2022-01-18 22:39:16,523 INFO L132 encePairwiseOnDemand]: 110/116 looper letters, 39 selfloop transitions, 3 changer transitions 17/160 dead transitions. [2022-01-18 22:39:16,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 160 transitions, 774 flow [2022-01-18 22:39:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:39:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:39:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 707 transitions. [2022-01-18 22:39:16,526 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8706896551724138 [2022-01-18 22:39:16,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 707 transitions. [2022-01-18 22:39:16,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 707 transitions. [2022-01-18 22:39:16,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:39:16,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 707 transitions. [2022-01-18 22:39:16,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:16,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:16,530 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:16,530 INFO L186 Difference]: Start difference. First operand has 133 places, 121 transitions, 506 flow. Second operand 7 states and 707 transitions. [2022-01-18 22:39:16,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 160 transitions, 774 flow [2022-01-18 22:39:16,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 160 transitions, 720 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-01-18 22:39:16,565 INFO L242 Difference]: Finished difference. Result has 142 places, 123 transitions, 489 flow [2022-01-18 22:39:16,565 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=142, PETRI_TRANSITIONS=123} [2022-01-18 22:39:16,567 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 21 predicate places. [2022-01-18 22:39:16,567 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 123 transitions, 489 flow [2022-01-18 22:39:16,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:16,568 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:16,568 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:16,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:39:16,568 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash -391975216, now seen corresponding path program 2 times [2022-01-18 22:39:16,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:16,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475547926] [2022-01-18 22:39:16,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:16,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:39:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:39:16,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:39:16,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475547926] [2022-01-18 22:39:16,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475547926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:39:16,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:39:16,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:39:16,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033129058] [2022-01-18 22:39:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:39:16,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:39:16,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:39:16,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:39:16,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:39:16,705 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2022-01-18 22:39:16,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 123 transitions, 489 flow. Second operand has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:16,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:39:16,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2022-01-18 22:39:16,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:39:17,463 INFO L129 PetriNetUnfolder]: 1246/3117 cut-off events. [2022-01-18 22:39:17,463 INFO L130 PetriNetUnfolder]: For 5172/5414 co-relation queries the response was YES. [2022-01-18 22:39:17,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9535 conditions, 3117 events. 1246/3117 cut-off events. For 5172/5414 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 27176 event pairs, 105 based on Foata normal form. 76/3102 useless extension candidates. Maximal degree in co-relation 9508. Up to 446 conditions per place. [2022-01-18 22:39:17,481 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 27 selfloop transitions, 14 changer transitions 54/176 dead transitions. [2022-01-18 22:39:17,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 176 transitions, 949 flow [2022-01-18 22:39:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 22:39:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-18 22:39:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1381 transitions. [2022-01-18 22:39:17,485 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8503694581280788 [2022-01-18 22:39:17,485 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1381 transitions. [2022-01-18 22:39:17,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1381 transitions. [2022-01-18 22:39:17,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:39:17,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1381 transitions. [2022-01-18 22:39:17,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 98.64285714285714) internal successors, (1381), 14 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:17,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:17,492 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:17,492 INFO L186 Difference]: Start difference. First operand has 142 places, 123 transitions, 489 flow. Second operand 14 states and 1381 transitions. [2022-01-18 22:39:17,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 176 transitions, 949 flow [2022-01-18 22:39:17,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 176 transitions, 909 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-01-18 22:39:17,529 INFO L242 Difference]: Finished difference. Result has 153 places, 111 transitions, 425 flow [2022-01-18 22:39:17,529 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=425, PETRI_PLACES=153, PETRI_TRANSITIONS=111} [2022-01-18 22:39:17,530 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 32 predicate places. [2022-01-18 22:39:17,530 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 111 transitions, 425 flow [2022-01-18 22:39:17,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:17,531 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:17,531 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:17,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:39:17,531 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1532908603, now seen corresponding path program 1 times [2022-01-18 22:39:17,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:17,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492013672] [2022-01-18 22:39:17,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:17,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:39:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:39:17,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:39:17,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492013672] [2022-01-18 22:39:17,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492013672] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:39:17,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:39:17,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:39:17,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059139012] [2022-01-18 22:39:17,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:39:17,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:39:17,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:39:17,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:39:17,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:39:17,661 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2022-01-18 22:39:17,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 111 transitions, 425 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:17,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:39:17,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2022-01-18 22:39:17,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:39:17,898 INFO L129 PetriNetUnfolder]: 151/1077 cut-off events. [2022-01-18 22:39:17,898 INFO L130 PetriNetUnfolder]: For 2039/2085 co-relation queries the response was YES. [2022-01-18 22:39:17,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 1077 events. 151/1077 cut-off events. For 2039/2085 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9886 event pairs, 18 based on Foata normal form. 5/1019 useless extension candidates. Maximal degree in co-relation 2853. Up to 186 conditions per place. [2022-01-18 22:39:17,911 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 19 selfloop transitions, 5 changer transitions 18/127 dead transitions. [2022-01-18 22:39:17,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 127 transitions, 581 flow [2022-01-18 22:39:17,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:39:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:39:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2022-01-18 22:39:17,914 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8165024630541872 [2022-01-18 22:39:17,914 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 663 transitions. [2022-01-18 22:39:17,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 663 transitions. [2022-01-18 22:39:17,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:39:17,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 663 transitions. [2022-01-18 22:39:17,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:17,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:17,919 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:17,919 INFO L186 Difference]: Start difference. First operand has 153 places, 111 transitions, 425 flow. Second operand 7 states and 663 transitions. [2022-01-18 22:39:17,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 127 transitions, 581 flow [2022-01-18 22:39:17,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 127 transitions, 455 flow, removed 41 selfloop flow, removed 22 redundant places. [2022-01-18 22:39:17,937 INFO L242 Difference]: Finished difference. Result has 132 places, 107 transitions, 321 flow [2022-01-18 22:39:17,937 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=132, PETRI_TRANSITIONS=107} [2022-01-18 22:39:17,939 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 11 predicate places. [2022-01-18 22:39:17,939 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 107 transitions, 321 flow [2022-01-18 22:39:17,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:17,940 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:17,940 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:17,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:39:17,940 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1926835497, now seen corresponding path program 2 times [2022-01-18 22:39:17,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:17,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459129552] [2022-01-18 22:39:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:17,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:39:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:39:18,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:39:18,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459129552] [2022-01-18 22:39:18,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459129552] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:39:18,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:39:18,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:39:18,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795837173] [2022-01-18 22:39:18,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:39:18,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:39:18,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:39:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:39:18,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:39:18,152 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 116 [2022-01-18 22:39:18,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 107 transitions, 321 flow. Second operand has 9 states, 9 states have (on average 92.33333333333333) internal successors, (831), 9 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:18,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:39:18,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 116 [2022-01-18 22:39:18,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:39:18,357 INFO L129 PetriNetUnfolder]: 56/483 cut-off events. [2022-01-18 22:39:18,358 INFO L130 PetriNetUnfolder]: For 174/187 co-relation queries the response was YES. [2022-01-18 22:39:18,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 483 events. 56/483 cut-off events. For 174/187 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3359 event pairs, 2 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 859. Up to 72 conditions per place. [2022-01-18 22:39:18,360 INFO L132 encePairwiseOnDemand]: 107/116 looper letters, 21 selfloop transitions, 5 changer transitions 7/119 dead transitions. [2022-01-18 22:39:18,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 119 transitions, 427 flow [2022-01-18 22:39:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:39:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:39:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 934 transitions. [2022-01-18 22:39:18,364 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8051724137931034 [2022-01-18 22:39:18,364 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 934 transitions. [2022-01-18 22:39:18,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 934 transitions. [2022-01-18 22:39:18,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:39:18,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 934 transitions. [2022-01-18 22:39:18,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:18,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:18,369 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:18,369 INFO L186 Difference]: Start difference. First operand has 132 places, 107 transitions, 321 flow. Second operand 10 states and 934 transitions. [2022-01-18 22:39:18,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 119 transitions, 427 flow [2022-01-18 22:39:18,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 119 transitions, 393 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-01-18 22:39:18,373 INFO L242 Difference]: Finished difference. Result has 137 places, 109 transitions, 326 flow [2022-01-18 22:39:18,373 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=326, PETRI_PLACES=137, PETRI_TRANSITIONS=109} [2022-01-18 22:39:18,374 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 16 predicate places. [2022-01-18 22:39:18,374 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 109 transitions, 326 flow [2022-01-18 22:39:18,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.33333333333333) internal successors, (831), 9 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:39:18,374 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:39:18,374 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:39:18,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:39:18,375 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:39:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:39:18,375 INFO L85 PathProgramCache]: Analyzing trace with hash -680506371, now seen corresponding path program 3 times [2022-01-18 22:39:18,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:39:18,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285957832] [2022-01-18 22:39:18,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:39:18,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:39:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:39:18,415 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:39:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:39:18,482 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:39:18,482 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:39:18,483 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-18 22:39:18,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-18 22:39:18,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-18 22:39:18,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-18 22:39:18,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-18 22:39:18,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-18 22:39:18,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:39:18,504 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-01-18 22:39:18,508 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:39:18,508 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:39:18,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:39:18 BasicIcfg [2022-01-18 22:39:18,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:39:18,636 INFO L158 Benchmark]: Toolchain (without parser) took 8458.21ms. Allocated memory was 379.6MB in the beginning and 813.7MB in the end (delta: 434.1MB). Free memory was 324.9MB in the beginning and 463.1MB in the end (delta: -138.2MB). Peak memory consumption was 298.1MB. Max. memory is 16.0GB. [2022-01-18 22:39:18,636 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 379.6MB. Free memory is still 342.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:39:18,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.15ms. Allocated memory is still 379.6MB. Free memory was 324.8MB in the beginning and 338.4MB in the end (delta: -13.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.0GB. [2022-01-18 22:39:18,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.51ms. Allocated memory is still 379.6MB. Free memory was 338.4MB in the beginning and 336.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:39:18,637 INFO L158 Benchmark]: Boogie Preprocessor took 33.26ms. Allocated memory is still 379.6MB. Free memory was 335.3MB in the beginning and 334.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:39:18,637 INFO L158 Benchmark]: RCFGBuilder took 963.29ms. Allocated memory is still 379.6MB. Free memory was 333.2MB in the beginning and 261.9MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. [2022-01-18 22:39:18,638 INFO L158 Benchmark]: TraceAbstraction took 6989.09ms. Allocated memory was 379.6MB in the beginning and 813.7MB in the end (delta: 434.1MB). Free memory was 260.8MB in the beginning and 463.1MB in the end (delta: -202.3MB). Peak memory consumption was 233.9MB. Max. memory is 16.0GB. [2022-01-18 22:39:18,639 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.13ms. Allocated memory is still 379.6MB. Free memory is still 342.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 402.15ms. Allocated memory is still 379.6MB. Free memory was 324.8MB in the beginning and 338.4MB in the end (delta: -13.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.51ms. Allocated memory is still 379.6MB. Free memory was 338.4MB in the beginning and 336.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.26ms. Allocated memory is still 379.6MB. Free memory was 335.3MB in the beginning and 334.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 963.29ms. Allocated memory is still 379.6MB. Free memory was 333.2MB in the beginning and 261.9MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. * TraceAbstraction took 6989.09ms. Allocated memory was 379.6MB in the beginning and 813.7MB in the end (delta: 434.1MB). Free memory was 260.8MB in the beginning and 463.1MB in the end (delta: -202.3MB). Peak memory consumption was 233.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t666; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t666, ((void *)0), P0, ((void *)0))=-2, t666={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] 0 pthread_t t667; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t666={5:0}, t667={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t667, ((void *)0), P1, ((void *)0))=-1, t666={5:0}, t667={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] 0 pthread_t t668; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t668, ((void *)0), P2, ((void *)0))=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 19]: 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: 835]: 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: 837]: 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: 839]: 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 7 procedures, 143 locations, 6 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: 6.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 748 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 996 IncrementalHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 89 mSDtfsCounter, 996 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=5, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 2559 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2022-01-18 22:39:18,681 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...