/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:51:28,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:51:28,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:51:28,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:51:28,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:51:28,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:51:28,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:51:28,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:51:28,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:51:28,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:51:28,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:51:28,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:51:28,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:51:28,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:51:28,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:51:28,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:51:28,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:51:28,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:51:28,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:51:28,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:51:28,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:51:28,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:51:28,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:51:28,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:51:28,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:51:28,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:51:28,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:51:28,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:51:28,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:51:28,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:51:28,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:51:28,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:51:28,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:51:28,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:51:28,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:51:28,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:51:28,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:51:28,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:51:28,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:51:28,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:51:28,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:51:28,678 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-SemanticLbe-SemanticLooper.epf [2020-10-16 04:51:28,699 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:51:28,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:51:28,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:51:28,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:51:28,701 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:51:28,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:51:28,701 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:51:28,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:51:28,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:51:28,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:51:28,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:51:28,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:51:28,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:51:28,703 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:51:28,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:51:28,703 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:51:28,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:51:28,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:51:28,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:51:28,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:51:28,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:51:28,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:51:28,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:51:28,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:51:28,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:51:28,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:51:28,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:51:28,705 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:51:28,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:51:29,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:51:29,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:51:29,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:51:29,017 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:51:29,020 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:51:29,020 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2020-10-16 04:51:29,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddedf290e/d643c85d65524852ba6aa2fb002a85e7/FLAG3993a5999 [2020-10-16 04:51:29,679 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:51:29,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2020-10-16 04:51:29,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddedf290e/d643c85d65524852ba6aa2fb002a85e7/FLAG3993a5999 [2020-10-16 04:51:29,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddedf290e/d643c85d65524852ba6aa2fb002a85e7 [2020-10-16 04:51:29,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:51:29,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:51:29,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:29,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:51:29,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:51:29,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:29" (1/1) ... [2020-10-16 04:51:29,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba0a647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:29, skipping insertion in model container [2020-10-16 04:51:29,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:29" (1/1) ... [2020-10-16 04:51:29,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:51:30,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:51:30,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:30,503 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:51:30,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:30,663 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:51:30,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30 WrapperNode [2020-10-16 04:51:30,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:30,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:30,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:51:30,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:51:30,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... [2020-10-16 04:51:30,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... [2020-10-16 04:51:30,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:30,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:51:30,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:51:30,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:51:30,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... [2020-10-16 04:51:30,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... [2020-10-16 04:51:30,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... [2020-10-16 04:51:30,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... [2020-10-16 04:51:30,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... [2020-10-16 04:51:30,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... [2020-10-16 04:51:30,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... [2020-10-16 04:51:30,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:51:30,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:51:30,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:51:30,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:51:30,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:51:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:51:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:51:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:51:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:51:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:51:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:51:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:51:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:51:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:51:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:51:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:51:30,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:51:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:51:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:51:30,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:51:30,878 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:51:33,039 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:51:33,040 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:51:33,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:33 BoogieIcfgContainer [2020-10-16 04:51:33,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:51:33,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:51:33,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:51:33,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:51:33,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:51:29" (1/3) ... [2020-10-16 04:51:33,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db9b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:33, skipping insertion in model container [2020-10-16 04:51:33,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:30" (2/3) ... [2020-10-16 04:51:33,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db9b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:33, skipping insertion in model container [2020-10-16 04:51:33,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:33" (3/3) ... [2020-10-16 04:51:33,050 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2020-10-16 04:51:33,061 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:51:33,069 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:51:33,070 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:51:33,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,109 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,109 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,109 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,110 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,114 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,114 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,118 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,118 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,131 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,131 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,138 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,138 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,141 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,143 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:33,159 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:51:33,180 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:51:33,181 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:51:33,181 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:51:33,184 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:51:33,185 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:51:33,185 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:51:33,186 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:51:33,191 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:51:33,211 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 248 flow [2020-10-16 04:51:33,301 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2020-10-16 04:51:33,301 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:33,310 INFO L80 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 04:51:33,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 248 flow [2020-10-16 04:51:33,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 110 transitions, 232 flow [2020-10-16 04:51:33,322 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:51:33,326 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 232 flow [2020-10-16 04:51:33,329 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 232 flow [2020-10-16 04:51:33,329 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 232 flow [2020-10-16 04:51:33,381 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2020-10-16 04:51:33,381 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:33,383 INFO L80 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 04:51:33,387 INFO L117 LiptonReduction]: Number of co-enabled transitions 2806 [2020-10-16 04:51:33,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:33,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:33,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:33,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:33,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:33,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:33,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:33,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:33,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:33,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:33,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:33,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:33,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:33,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:33,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:33,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:33,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:33,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:33,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:33,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:33,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:33,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:33,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:33,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:51:33,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:34,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:34,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:34,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:34,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:34,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:34,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:34,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:34,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:34,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:34,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:34,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:34,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:34,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:34,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:34,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:34,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:34,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:34,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:34,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:34,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:34,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:34,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:34,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:34,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:34,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 04:51:34,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:34,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:34,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:34,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:34,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:35,641 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 04:51:35,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 04:51:35,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:35,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:35,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:37,015 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-16 04:51:37,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:37,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:37,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:37,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:37,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:37,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:37,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:37,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:37,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:51:37,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:37,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:37,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:37,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:37,931 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 04:51:38,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:51:38,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:38,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:38,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:38,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:38,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:38,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:38,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:38,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:38,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:38,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:38,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:38,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:38,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:38,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:38,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:38,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:38,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:38,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:38,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:38,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:38,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:38,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:38,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:38,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:38,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:38,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:38,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:38,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:38,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:38,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:38,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:38,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:38,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:39,646 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-16 04:51:39,775 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 04:51:39,792 INFO L132 LiptonReduction]: Checked pairs total: 7943 [2020-10-16 04:51:39,792 INFO L134 LiptonReduction]: Total number of compositions: 91 [2020-10-16 04:51:39,795 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6476 [2020-10-16 04:51:39,802 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2020-10-16 04:51:39,802 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:39,802 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:39,803 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:51:39,804 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1154635991, now seen corresponding path program 1 times [2020-10-16 04:51:39,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:39,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666899133] [2020-10-16 04:51:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:40,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666899133] [2020-10-16 04:51:40,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:40,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:51:40,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132596512] [2020-10-16 04:51:40,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:51:40,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:51:40,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:51:40,068 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 205 [2020-10-16 04:51:40,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states. [2020-10-16 04:51:40,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:40,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 205 [2020-10-16 04:51:40,072 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:40,223 INFO L129 PetriNetUnfolder]: 133/300 cut-off events. [2020-10-16 04:51:40,223 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:40,225 INFO L80 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 300 events. 133/300 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1585 event pairs, 87 based on Foata normal form. 21/283 useless extension candidates. Maximal degree in co-relation 508. Up to 153 conditions per place. [2020-10-16 04:51:40,228 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 11 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2020-10-16 04:51:40,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 108 flow [2020-10-16 04:51:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:51:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:51:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2020-10-16 04:51:40,247 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8894308943089431 [2020-10-16 04:51:40,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2020-10-16 04:51:40,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2020-10-16 04:51:40,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:40,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2020-10-16 04:51:40,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:51:40,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:51:40,266 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:51:40,268 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 547 transitions. [2020-10-16 04:51:40,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 108 flow [2020-10-16 04:51:40,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:40,308 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 72 flow [2020-10-16 04:51:40,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2020-10-16 04:51:40,312 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2020-10-16 04:51:40,312 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2020-10-16 04:51:40,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:51:40,312 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:40,312 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:40,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:51:40,313 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2057156839, now seen corresponding path program 1 times [2020-10-16 04:51:40,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:40,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851189764] [2020-10-16 04:51:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:40,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851189764] [2020-10-16 04:51:40,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:40,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:51:40,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66545547] [2020-10-16 04:51:40,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:51:40,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:51:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:51:40,477 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 205 [2020-10-16 04:51:40,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand 4 states. [2020-10-16 04:51:40,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:40,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 205 [2020-10-16 04:51:40,478 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:40,776 INFO L129 PetriNetUnfolder]: 819/1355 cut-off events. [2020-10-16 04:51:40,776 INFO L130 PetriNetUnfolder]: For 120/120 co-relation queries the response was YES. [2020-10-16 04:51:40,781 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 1355 events. 819/1355 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8008 event pairs, 437 based on Foata normal form. 0/1260 useless extension candidates. Maximal degree in co-relation 2669. Up to 861 conditions per place. [2020-10-16 04:51:40,787 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 12 selfloop transitions, 4 changer transitions 15/49 dead transitions. [2020-10-16 04:51:40,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 178 flow [2020-10-16 04:51:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 823 transitions. [2020-10-16 04:51:40,791 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8029268292682927 [2020-10-16 04:51:40,791 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 823 transitions. [2020-10-16 04:51:40,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 823 transitions. [2020-10-16 04:51:40,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:40,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 823 transitions. [2020-10-16 04:51:40,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:40,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:40,797 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:40,797 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 5 states and 823 transitions. [2020-10-16 04:51:40,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 178 flow [2020-10-16 04:51:40,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:40,799 INFO L241 Difference]: Finished difference. Result has 46 places, 32 transitions, 102 flow [2020-10-16 04:51:40,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2020-10-16 04:51:40,800 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2020-10-16 04:51:40,800 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 102 flow [2020-10-16 04:51:40,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:51:40,800 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:40,800 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:40,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:51:40,801 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash 350205039, now seen corresponding path program 1 times [2020-10-16 04:51:40,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:40,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028312300] [2020-10-16 04:51:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:41,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028312300] [2020-10-16 04:51:41,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:41,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:41,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490684058] [2020-10-16 04:51:41,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:41,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:41,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:41,084 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 205 [2020-10-16 04:51:41,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 102 flow. Second operand 6 states. [2020-10-16 04:51:41,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:41,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 205 [2020-10-16 04:51:41,085 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:41,467 INFO L129 PetriNetUnfolder]: 533/963 cut-off events. [2020-10-16 04:51:41,467 INFO L130 PetriNetUnfolder]: For 550/562 co-relation queries the response was YES. [2020-10-16 04:51:41,471 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 963 events. 533/963 cut-off events. For 550/562 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5759 event pairs, 124 based on Foata normal form. 78/1001 useless extension candidates. Maximal degree in co-relation 2200. Up to 448 conditions per place. [2020-10-16 04:51:41,476 INFO L132 encePairwiseOnDemand]: 197/205 looper letters, 13 selfloop transitions, 8 changer transitions 16/58 dead transitions. [2020-10-16 04:51:41,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 244 flow [2020-10-16 04:51:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1159 transitions. [2020-10-16 04:51:41,480 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8076655052264808 [2020-10-16 04:51:41,480 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1159 transitions. [2020-10-16 04:51:41,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1159 transitions. [2020-10-16 04:51:41,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:41,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1159 transitions. [2020-10-16 04:51:41,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:41,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:41,486 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:41,486 INFO L185 Difference]: Start difference. First operand has 46 places, 32 transitions, 102 flow. Second operand 7 states and 1159 transitions. [2020-10-16 04:51:41,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 244 flow [2020-10-16 04:51:41,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 238 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:41,491 INFO L241 Difference]: Finished difference. Result has 52 places, 37 transitions, 165 flow [2020-10-16 04:51:41,491 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=165, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2020-10-16 04:51:41,491 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2020-10-16 04:51:41,491 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 165 flow [2020-10-16 04:51:41,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:41,492 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:41,492 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:41,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:51:41,492 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1243533532, now seen corresponding path program 1 times [2020-10-16 04:51:41,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:41,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191449125] [2020-10-16 04:51:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:41,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191449125] [2020-10-16 04:51:41,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:41,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:41,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547219130] [2020-10-16 04:51:41,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:41,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:41,627 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 205 [2020-10-16 04:51:41,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 165 flow. Second operand 5 states. [2020-10-16 04:51:41,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:41,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 205 [2020-10-16 04:51:41,628 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:41,930 INFO L129 PetriNetUnfolder]: 620/1115 cut-off events. [2020-10-16 04:51:41,930 INFO L130 PetriNetUnfolder]: For 2417/2583 co-relation queries the response was YES. [2020-10-16 04:51:41,936 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3661 conditions, 1115 events. 620/1115 cut-off events. For 2417/2583 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6639 event pairs, 193 based on Foata normal form. 61/1113 useless extension candidates. Maximal degree in co-relation 3644. Up to 702 conditions per place. [2020-10-16 04:51:41,944 INFO L132 encePairwiseOnDemand]: 200/205 looper letters, 17 selfloop transitions, 5 changer transitions 11/55 dead transitions. [2020-10-16 04:51:41,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 331 flow [2020-10-16 04:51:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 808 transitions. [2020-10-16 04:51:41,947 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7882926829268293 [2020-10-16 04:51:41,947 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 808 transitions. [2020-10-16 04:51:41,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 808 transitions. [2020-10-16 04:51:41,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:41,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 808 transitions. [2020-10-16 04:51:41,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:41,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:41,952 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:41,952 INFO L185 Difference]: Start difference. First operand has 52 places, 37 transitions, 165 flow. Second operand 5 states and 808 transitions. [2020-10-16 04:51:41,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 331 flow [2020-10-16 04:51:41,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 316 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:41,961 INFO L241 Difference]: Finished difference. Result has 53 places, 41 transitions, 217 flow [2020-10-16 04:51:41,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2020-10-16 04:51:41,961 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2020-10-16 04:51:41,962 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 217 flow [2020-10-16 04:51:41,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:41,962 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:41,962 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:41,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:51:41,962 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:41,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:41,963 INFO L82 PathProgramCache]: Analyzing trace with hash -130683318, now seen corresponding path program 1 times [2020-10-16 04:51:41,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:41,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956907289] [2020-10-16 04:51:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:42,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956907289] [2020-10-16 04:51:42,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:42,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:42,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383572543] [2020-10-16 04:51:42,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:42,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:42,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:42,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:42,211 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 205 [2020-10-16 04:51:42,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 217 flow. Second operand 6 states. [2020-10-16 04:51:42,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:42,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 205 [2020-10-16 04:51:42,213 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:42,591 INFO L129 PetriNetUnfolder]: 593/1084 cut-off events. [2020-10-16 04:51:42,591 INFO L130 PetriNetUnfolder]: For 2832/3078 co-relation queries the response was YES. [2020-10-16 04:51:42,597 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 1084 events. 593/1084 cut-off events. For 2832/3078 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6517 event pairs, 187 based on Foata normal form. 67/1091 useless extension candidates. Maximal degree in co-relation 3777. Up to 672 conditions per place. [2020-10-16 04:51:42,607 INFO L132 encePairwiseOnDemand]: 197/205 looper letters, 18 selfloop transitions, 11 changer transitions 10/61 dead transitions. [2020-10-16 04:51:42,607 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 395 flow [2020-10-16 04:51:42,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:51:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:51:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 950 transitions. [2020-10-16 04:51:42,611 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7723577235772358 [2020-10-16 04:51:42,611 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 950 transitions. [2020-10-16 04:51:42,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 950 transitions. [2020-10-16 04:51:42,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:42,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 950 transitions. [2020-10-16 04:51:42,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:51:42,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:51:42,617 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:51:42,617 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 217 flow. Second operand 6 states and 950 transitions. [2020-10-16 04:51:42,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 395 flow [2020-10-16 04:51:42,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 388 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:42,622 INFO L241 Difference]: Finished difference. Result has 57 places, 47 transitions, 299 flow [2020-10-16 04:51:42,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2020-10-16 04:51:42,623 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2020-10-16 04:51:42,623 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 299 flow [2020-10-16 04:51:42,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:42,623 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:42,624 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:42,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:51:42,624 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:42,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1969529252, now seen corresponding path program 1 times [2020-10-16 04:51:42,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:42,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684574030] [2020-10-16 04:51:42,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:42,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684574030] [2020-10-16 04:51:42,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:42,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:42,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281960424] [2020-10-16 04:51:42,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:42,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:42,702 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 205 [2020-10-16 04:51:42,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 299 flow. Second operand 5 states. [2020-10-16 04:51:42,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:42,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 205 [2020-10-16 04:51:42,703 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:43,047 INFO L129 PetriNetUnfolder]: 647/1164 cut-off events. [2020-10-16 04:51:43,048 INFO L130 PetriNetUnfolder]: For 5479/5900 co-relation queries the response was YES. [2020-10-16 04:51:43,055 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5162 conditions, 1164 events. 647/1164 cut-off events. For 5479/5900 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6873 event pairs, 162 based on Foata normal form. 51/1140 useless extension candidates. Maximal degree in co-relation 5140. Up to 657 conditions per place. [2020-10-16 04:51:43,066 INFO L132 encePairwiseOnDemand]: 196/205 looper letters, 23 selfloop transitions, 15 changer transitions 9/69 dead transitions. [2020-10-16 04:51:43,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 577 flow [2020-10-16 04:51:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:51:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:51:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 981 transitions. [2020-10-16 04:51:43,071 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7975609756097561 [2020-10-16 04:51:43,071 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 981 transitions. [2020-10-16 04:51:43,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 981 transitions. [2020-10-16 04:51:43,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:43,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 981 transitions. [2020-10-16 04:51:43,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:51:43,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:51:43,076 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:51:43,076 INFO L185 Difference]: Start difference. First operand has 57 places, 47 transitions, 299 flow. Second operand 6 states and 981 transitions. [2020-10-16 04:51:43,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 577 flow [2020-10-16 04:51:43,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 552 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:43,083 INFO L241 Difference]: Finished difference. Result has 60 places, 54 transitions, 386 flow [2020-10-16 04:51:43,084 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2020-10-16 04:51:43,084 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2020-10-16 04:51:43,084 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 386 flow [2020-10-16 04:51:43,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:43,084 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:43,084 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:43,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:51:43,085 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:43,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:43,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2021731694, now seen corresponding path program 2 times [2020-10-16 04:51:43,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:43,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357758898] [2020-10-16 04:51:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:43,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357758898] [2020-10-16 04:51:43,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:43,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:43,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621577130] [2020-10-16 04:51:43,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:43,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:43,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:43,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:43,281 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 205 [2020-10-16 04:51:43,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 386 flow. Second operand 6 states. [2020-10-16 04:51:43,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:43,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 205 [2020-10-16 04:51:43,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:43,624 INFO L129 PetriNetUnfolder]: 591/1081 cut-off events. [2020-10-16 04:51:43,624 INFO L130 PetriNetUnfolder]: For 6207/7070 co-relation queries the response was YES. [2020-10-16 04:51:43,632 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 1081 events. 591/1081 cut-off events. For 6207/7070 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6405 event pairs, 127 based on Foata normal form. 73/1083 useless extension candidates. Maximal degree in co-relation 5203. Up to 633 conditions per place. [2020-10-16 04:51:43,643 INFO L132 encePairwiseOnDemand]: 200/205 looper letters, 28 selfloop transitions, 11 changer transitions 9/70 dead transitions. [2020-10-16 04:51:43,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 632 flow [2020-10-16 04:51:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:51:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:51:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 966 transitions. [2020-10-16 04:51:43,647 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7853658536585366 [2020-10-16 04:51:43,647 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 966 transitions. [2020-10-16 04:51:43,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 966 transitions. [2020-10-16 04:51:43,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:43,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 966 transitions. [2020-10-16 04:51:43,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:51:43,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:51:43,652 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:51:43,652 INFO L185 Difference]: Start difference. First operand has 60 places, 54 transitions, 386 flow. Second operand 6 states and 966 transitions. [2020-10-16 04:51:43,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 632 flow [2020-10-16 04:51:43,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 589 flow, removed 16 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:43,660 INFO L241 Difference]: Finished difference. Result has 63 places, 54 transitions, 381 flow [2020-10-16 04:51:43,660 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2020-10-16 04:51:43,660 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2020-10-16 04:51:43,660 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 381 flow [2020-10-16 04:51:43,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:43,660 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:43,661 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:43,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:51:43,661 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -701919954, now seen corresponding path program 1 times [2020-10-16 04:51:43,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:43,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844329165] [2020-10-16 04:51:43,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:43,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844329165] [2020-10-16 04:51:43,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:43,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:43,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851311651] [2020-10-16 04:51:43,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:43,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:43,823 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 205 [2020-10-16 04:51:43,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 381 flow. Second operand 7 states. [2020-10-16 04:51:43,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:43,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 205 [2020-10-16 04:51:43,824 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:44,246 INFO L129 PetriNetUnfolder]: 583/1078 cut-off events. [2020-10-16 04:51:44,246 INFO L130 PetriNetUnfolder]: For 6132/6887 co-relation queries the response was YES. [2020-10-16 04:51:44,255 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 1078 events. 583/1078 cut-off events. For 6132/6887 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6511 event pairs, 124 based on Foata normal form. 81/1098 useless extension candidates. Maximal degree in co-relation 5077. Up to 609 conditions per place. [2020-10-16 04:51:44,265 INFO L132 encePairwiseOnDemand]: 195/205 looper letters, 22 selfloop transitions, 22 changer transitions 9/75 dead transitions. [2020-10-16 04:51:44,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 675 flow [2020-10-16 04:51:44,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1114 transitions. [2020-10-16 04:51:44,269 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7763066202090593 [2020-10-16 04:51:44,269 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1114 transitions. [2020-10-16 04:51:44,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1114 transitions. [2020-10-16 04:51:44,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:44,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1114 transitions. [2020-10-16 04:51:44,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:44,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:44,278 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:44,278 INFO L185 Difference]: Start difference. First operand has 63 places, 54 transitions, 381 flow. Second operand 7 states and 1114 transitions. [2020-10-16 04:51:44,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 675 flow [2020-10-16 04:51:44,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 646 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-16 04:51:44,289 INFO L241 Difference]: Finished difference. Result has 65 places, 61 transitions, 494 flow [2020-10-16 04:51:44,289 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2020-10-16 04:51:44,289 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2020-10-16 04:51:44,289 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 494 flow [2020-10-16 04:51:44,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:44,290 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:44,290 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:44,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:51:44,290 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:44,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:44,291 INFO L82 PathProgramCache]: Analyzing trace with hash -126831744, now seen corresponding path program 2 times [2020-10-16 04:51:44,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:44,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336990612] [2020-10-16 04:51:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:44,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336990612] [2020-10-16 04:51:44,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:44,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:44,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560750920] [2020-10-16 04:51:44,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:44,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:44,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:44,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:44,526 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 205 [2020-10-16 04:51:44,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 494 flow. Second operand 7 states. [2020-10-16 04:51:44,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:44,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 205 [2020-10-16 04:51:44,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:44,935 INFO L129 PetriNetUnfolder]: 696/1263 cut-off events. [2020-10-16 04:51:44,936 INFO L130 PetriNetUnfolder]: For 10153/11091 co-relation queries the response was YES. [2020-10-16 04:51:44,943 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7055 conditions, 1263 events. 696/1263 cut-off events. For 10153/11091 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7688 event pairs, 94 based on Foata normal form. 90/1277 useless extension candidates. Maximal degree in co-relation 7029. Up to 693 conditions per place. [2020-10-16 04:51:44,957 INFO L132 encePairwiseOnDemand]: 196/205 looper letters, 29 selfloop transitions, 25 changer transitions 9/85 dead transitions. [2020-10-16 04:51:44,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 908 flow [2020-10-16 04:51:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1141 transitions. [2020-10-16 04:51:44,962 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7951219512195122 [2020-10-16 04:51:44,962 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1141 transitions. [2020-10-16 04:51:44,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1141 transitions. [2020-10-16 04:51:44,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:44,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1141 transitions. [2020-10-16 04:51:44,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:44,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:44,968 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:44,968 INFO L185 Difference]: Start difference. First operand has 65 places, 61 transitions, 494 flow. Second operand 7 states and 1141 transitions. [2020-10-16 04:51:44,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 908 flow [2020-10-16 04:51:44,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 850 flow, removed 12 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:44,980 INFO L241 Difference]: Finished difference. Result has 68 places, 68 transitions, 616 flow [2020-10-16 04:51:44,980 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=616, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2020-10-16 04:51:44,981 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2020-10-16 04:51:44,981 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 616 flow [2020-10-16 04:51:44,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:44,981 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:44,981 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:44,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:51:44,981 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:44,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1100992282, now seen corresponding path program 3 times [2020-10-16 04:51:44,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:44,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095166268] [2020-10-16 04:51:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:45,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095166268] [2020-10-16 04:51:45,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:45,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:45,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724353882] [2020-10-16 04:51:45,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:45,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:45,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:45,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:45,116 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 205 [2020-10-16 04:51:45,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 616 flow. Second operand 7 states. [2020-10-16 04:51:45,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:45,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 205 [2020-10-16 04:51:45,117 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:45,581 INFO L129 PetriNetUnfolder]: 739/1328 cut-off events. [2020-10-16 04:51:45,581 INFO L130 PetriNetUnfolder]: For 16005/17096 co-relation queries the response was YES. [2020-10-16 04:51:45,594 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8610 conditions, 1328 events. 739/1328 cut-off events. For 16005/17096 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8079 event pairs, 131 based on Foata normal form. 148/1412 useless extension candidates. Maximal degree in co-relation 8582. Up to 773 conditions per place. [2020-10-16 04:51:45,610 INFO L132 encePairwiseOnDemand]: 195/205 looper letters, 34 selfloop transitions, 32 changer transitions 5/93 dead transitions. [2020-10-16 04:51:45,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 1099 flow [2020-10-16 04:51:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1117 transitions. [2020-10-16 04:51:45,614 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.778397212543554 [2020-10-16 04:51:45,614 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1117 transitions. [2020-10-16 04:51:45,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1117 transitions. [2020-10-16 04:51:45,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:45,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1117 transitions. [2020-10-16 04:51:45,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:45,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:45,620 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:45,620 INFO L185 Difference]: Start difference. First operand has 68 places, 68 transitions, 616 flow. Second operand 7 states and 1117 transitions. [2020-10-16 04:51:45,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 1099 flow [2020-10-16 04:51:45,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 922 flow, removed 70 selfloop flow, removed 6 redundant places. [2020-10-16 04:51:45,639 INFO L241 Difference]: Finished difference. Result has 68 places, 83 transitions, 784 flow [2020-10-16 04:51:45,639 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=784, PETRI_PLACES=68, PETRI_TRANSITIONS=83} [2020-10-16 04:51:45,639 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2020-10-16 04:51:45,639 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 83 transitions, 784 flow [2020-10-16 04:51:45,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:45,640 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:45,640 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:45,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:51:45,640 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:45,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1803200342, now seen corresponding path program 4 times [2020-10-16 04:51:45,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:45,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829205240] [2020-10-16 04:51:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:45,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829205240] [2020-10-16 04:51:45,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:45,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:45,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797810081] [2020-10-16 04:51:45,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:45,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:45,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:45,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:45,797 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 205 [2020-10-16 04:51:45,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 83 transitions, 784 flow. Second operand 7 states. [2020-10-16 04:51:45,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:45,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 205 [2020-10-16 04:51:45,798 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:46,247 INFO L129 PetriNetUnfolder]: 773/1398 cut-off events. [2020-10-16 04:51:46,247 INFO L130 PetriNetUnfolder]: For 12466/13934 co-relation queries the response was YES. [2020-10-16 04:51:46,255 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8365 conditions, 1398 events. 773/1398 cut-off events. For 12466/13934 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 8662 event pairs, 114 based on Foata normal form. 234/1563 useless extension candidates. Maximal degree in co-relation 8338. Up to 781 conditions per place. [2020-10-16 04:51:46,268 INFO L132 encePairwiseOnDemand]: 196/205 looper letters, 26 selfloop transitions, 57 changer transitions 9/114 dead transitions. [2020-10-16 04:51:46,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 1369 flow [2020-10-16 04:51:46,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:51:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:51:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1269 transitions. [2020-10-16 04:51:46,272 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7737804878048781 [2020-10-16 04:51:46,272 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1269 transitions. [2020-10-16 04:51:46,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1269 transitions. [2020-10-16 04:51:46,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:46,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1269 transitions. [2020-10-16 04:51:46,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:51:46,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:51:46,278 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:51:46,278 INFO L185 Difference]: Start difference. First operand has 68 places, 83 transitions, 784 flow. Second operand 8 states and 1269 transitions. [2020-10-16 04:51:46,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 1369 flow [2020-10-16 04:51:46,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 1317 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:46,292 INFO L241 Difference]: Finished difference. Result has 74 places, 100 transitions, 1157 flow [2020-10-16 04:51:46,292 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1157, PETRI_PLACES=74, PETRI_TRANSITIONS=100} [2020-10-16 04:51:46,293 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2020-10-16 04:51:46,293 INFO L481 AbstractCegarLoop]: Abstraction has has 74 places, 100 transitions, 1157 flow [2020-10-16 04:51:46,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:46,293 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:46,293 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:46,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:51:46,293 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:46,293 INFO L82 PathProgramCache]: Analyzing trace with hash 673564811, now seen corresponding path program 1 times [2020-10-16 04:51:46,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:46,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488515949] [2020-10-16 04:51:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:46,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488515949] [2020-10-16 04:51:46,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:46,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:46,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106054555] [2020-10-16 04:51:46,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:51:46,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:46,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:51:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:51:46,344 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 205 [2020-10-16 04:51:46,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 100 transitions, 1157 flow. Second operand 4 states. [2020-10-16 04:51:46,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:46,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 205 [2020-10-16 04:51:46,344 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:46,637 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L863-->L880: Formula: (let ((.cse29 (= 0 (mod v_~x$w_buff1_used~0_405 256))) (.cse30 (= (mod v_~x$r_buff1_thd0~0_206 256) 0)) (.cse27 (= (mod v_~x$r_buff0_thd0~0_284 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_81 256) 0)) (.cse3 (not .cse27)) (.cse7 (and .cse27 .cse30)) (.cse9 (and .cse29 .cse27)) (.cse28 (= (mod v_~x$w_buff0_used~0_570 256) 0))) (let ((.cse6 (or .cse7 .cse9 .cse28)) (.cse5 (not .cse28)) (.cse11 (or .cse3 (not .cse30))) (.cse12 (or .cse3 (not .cse29))) (.cse4 (or .cse27 .cse28)) (.cse1 (not .cse2))) (and (let ((.cse0 (= v_~x$w_buff0_used~0_569 v_~x$w_buff0_used~0_570))) (or (and .cse0 .cse1) (and .cse2 (or (and (or (and (= v_~x$w_buff0_used~0_569 0) .cse3) (and .cse4 .cse0)) .cse5) (and .cse0 .cse6))))) (= v_~x$w_buff1~0_149 v_~x$w_buff1~0_150) (let ((.cse10 (= v_~x$w_buff1_used~0_405 v_~x$w_buff1_used~0_404))) (or (and (let ((.cse8 (= (mod v_~x$w_buff0_used~0_569 256) 0))) (or (and (or .cse7 .cse8 .cse9) .cse10) (and (not .cse8) .cse11 .cse12 (= v_~x$w_buff1_used~0_404 0)))) .cse2) (and .cse1 .cse10))) (= v_~x$flush_delayed~0_37 0) (= |v_ULTIMATE.start_main_#t~nondet37_32| v_~weak$$choice2~0_81) (let ((.cse20 (= v_~__unbuffered_p1_EAX~0_23 0)) (.cse23 (= v_~z~0_24 2)) (.cse19 (= 0 v_~__unbuffered_p3_EBX~0_20)) (.cse21 (= v_~__unbuffered_p3_EAX~0_19 1))) (let ((.cse13 (= v_~main$tmp_guard1~0_19 1)) (.cse14 (not .cse21)) (.cse15 (not .cse19)) (.cse16 (not .cse23)) (.cse18 (not .cse20)) (.cse22 (= v_~main$tmp_guard1~0_19 0))) (or (and (let ((.cse17 (= 2 v_~x~0_231))) (or (and .cse13 (or .cse14 .cse15 .cse16 (not .cse17) .cse18)) (and .cse17 .cse19 .cse20 .cse21 .cse22 .cse23))) .cse6 (= v_~x~0_231 v_~x~0_230)) (and .cse5 .cse11 .cse12 (let ((.cse25 (and (= v_~x$mem_tmp~0_23 v_~x~0_230) .cse1))) (or (and (let ((.cse24 (= 2 v_~x$w_buff1~0_150))) (or (and .cse24 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse13 (or (not .cse24) .cse14 .cse15 .cse16 .cse18)))) .cse4 (or .cse25 (and .cse2 (= v_~x$w_buff1~0_150 v_~x~0_230)))) (and (let ((.cse26 (= 2 v_~x$w_buff0~0_155))) (or (and .cse13 (or (not .cse26) .cse14 .cse15 .cse16 .cse18)) (and .cse26 .cse19 .cse20 .cse21 .cse22 .cse23))) .cse3 (or .cse25 (and .cse2 (= v_~x$w_buff0~0_155 v_~x~0_230)))))))))) (= v_~x$r_buff1_thd0~0_206 v_~x$r_buff1_thd0~0_205) (= v_~x$r_buff0_thd0~0_284 v_~x$r_buff0_thd0~0_283) (= v_~x$w_buff0~0_155 v_~x$w_buff0~0_154) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_3|) (= |v_ULTIMATE.start_main_#t~nondet36_30| v_~weak$$choice0~0_13) (= v_~x$mem_tmp~0_23 v_~x~0_231))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_155, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_284, ~x$w_buff1~0=v_~x$w_buff1~0_150, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_405, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_206, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_570, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_32|, ~z~0=v_~z~0_24, ~x~0=v_~x~0_231} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_154, ~x$flush_delayed~0=v_~x$flush_delayed~0_37, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_29|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_76|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_70|, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_74|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_66|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_58|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_74|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_3|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_283, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~x$w_buff1~0=v_~x$w_buff1~0_149, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_29|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_39|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_404, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_50|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_205, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_43|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_64|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_46|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_569, ~weak$$choice0~0=v_~weak$$choice0~0_13, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_70|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_74|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_31|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_81, ~x~0=v_~x~0_230} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet36, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet37, ~weak$$choice2~0, ~x~0][79], [66#L795true, 71#L818true, Black: 260#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 262#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 197#(and (= ~x~0 1) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 264#(and (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 270#true, Black: 210#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 235#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (<= ~x$w_buff1~0 0)), 43#L782true, Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 52#P0EXITtrue, Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 118#L880true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:51:46,638 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2020-10-16 04:51:46,638 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2020-10-16 04:51:46,638 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2020-10-16 04:51:46,638 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2020-10-16 04:51:46,737 INFO L129 PetriNetUnfolder]: 1374/2413 cut-off events. [2020-10-16 04:51:46,737 INFO L130 PetriNetUnfolder]: For 23137/24440 co-relation queries the response was YES. [2020-10-16 04:51:46,756 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13336 conditions, 2413 events. 1374/2413 cut-off events. For 23137/24440 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 16646 event pairs, 439 based on Foata normal form. 405/2616 useless extension candidates. Maximal degree in co-relation 13306. Up to 1055 conditions per place. [2020-10-16 04:51:46,776 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 12 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2020-10-16 04:51:46,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 1166 flow [2020-10-16 04:51:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions. [2020-10-16 04:51:46,779 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8458536585365853 [2020-10-16 04:51:46,779 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 867 transitions. [2020-10-16 04:51:46,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions. [2020-10-16 04:51:46,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:46,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions. [2020-10-16 04:51:46,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:46,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:46,783 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:46,784 INFO L185 Difference]: Start difference. First operand has 74 places, 100 transitions, 1157 flow. Second operand 5 states and 867 transitions. [2020-10-16 04:51:46,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 1166 flow [2020-10-16 04:51:46,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 109 transitions, 1058 flow, removed 41 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:46,806 INFO L241 Difference]: Finished difference. Result has 75 places, 105 transitions, 1071 flow [2020-10-16 04:51:46,807 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1071, PETRI_PLACES=75, PETRI_TRANSITIONS=105} [2020-10-16 04:51:46,807 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2020-10-16 04:51:46,807 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 105 transitions, 1071 flow [2020-10-16 04:51:46,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:51:46,807 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:46,807 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:46,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:51:46,808 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1545486697, now seen corresponding path program 1 times [2020-10-16 04:51:46,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:46,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128315617] [2020-10-16 04:51:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:46,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128315617] [2020-10-16 04:51:46,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:46,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:46,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006381825] [2020-10-16 04:51:46,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:46,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:46,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:46,883 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 205 [2020-10-16 04:51:46,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 105 transitions, 1071 flow. Second operand 5 states. [2020-10-16 04:51:46,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:46,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 205 [2020-10-16 04:51:46,884 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:47,126 INFO L129 PetriNetUnfolder]: 688/1449 cut-off events. [2020-10-16 04:51:47,126 INFO L130 PetriNetUnfolder]: For 11456/14690 co-relation queries the response was YES. [2020-10-16 04:51:47,133 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7629 conditions, 1449 events. 688/1449 cut-off events. For 11456/14690 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10539 event pairs, 118 based on Foata normal form. 748/2089 useless extension candidates. Maximal degree in co-relation 7597. Up to 645 conditions per place. [2020-10-16 04:51:47,143 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 12 selfloop transitions, 19 changer transitions 0/105 dead transitions. [2020-10-16 04:51:47,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 105 transitions, 1050 flow [2020-10-16 04:51:47,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1214 transitions. [2020-10-16 04:51:47,148 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.845993031358885 [2020-10-16 04:51:47,148 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1214 transitions. [2020-10-16 04:51:47,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1214 transitions. [2020-10-16 04:51:47,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:47,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1214 transitions. [2020-10-16 04:51:47,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:47,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:47,154 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:47,154 INFO L185 Difference]: Start difference. First operand has 75 places, 105 transitions, 1071 flow. Second operand 7 states and 1214 transitions. [2020-10-16 04:51:47,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 105 transitions, 1050 flow [2020-10-16 04:51:47,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 1045 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:51:47,168 INFO L241 Difference]: Finished difference. Result has 83 places, 101 transitions, 1049 flow [2020-10-16 04:51:47,169 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1049, PETRI_PLACES=83, PETRI_TRANSITIONS=101} [2020-10-16 04:51:47,169 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2020-10-16 04:51:47,169 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 101 transitions, 1049 flow [2020-10-16 04:51:47,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:47,169 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:47,169 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:47,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:51:47,170 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:47,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:47,170 INFO L82 PathProgramCache]: Analyzing trace with hash -467839125, now seen corresponding path program 1 times [2020-10-16 04:51:47,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:47,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822314853] [2020-10-16 04:51:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:47,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822314853] [2020-10-16 04:51:47,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:47,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:47,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663193980] [2020-10-16 04:51:47,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:47,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:47,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:47,250 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 205 [2020-10-16 04:51:47,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 101 transitions, 1049 flow. Second operand 6 states. [2020-10-16 04:51:47,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:47,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 205 [2020-10-16 04:51:47,251 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:47,575 INFO L129 PetriNetUnfolder]: 460/1080 cut-off events. [2020-10-16 04:51:47,576 INFO L130 PetriNetUnfolder]: For 10207/15355 co-relation queries the response was YES. [2020-10-16 04:51:47,590 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6254 conditions, 1080 events. 460/1080 cut-off events. For 10207/15355 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8086 event pairs, 28 based on Foata normal form. 907/1902 useless extension candidates. Maximal degree in co-relation 6218. Up to 600 conditions per place. [2020-10-16 04:51:47,601 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 7 selfloop transitions, 28 changer transitions 4/104 dead transitions. [2020-10-16 04:51:47,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 104 transitions, 1125 flow [2020-10-16 04:51:47,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:51:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:51:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1561 transitions. [2020-10-16 04:51:47,610 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.846070460704607 [2020-10-16 04:51:47,610 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1561 transitions. [2020-10-16 04:51:47,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1561 transitions. [2020-10-16 04:51:47,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:47,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1561 transitions. [2020-10-16 04:51:47,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:51:47,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:51:47,623 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:51:47,623 INFO L185 Difference]: Start difference. First operand has 83 places, 101 transitions, 1049 flow. Second operand 9 states and 1561 transitions. [2020-10-16 04:51:47,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 104 transitions, 1125 flow [2020-10-16 04:51:47,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 104 transitions, 1034 flow, removed 20 selfloop flow, removed 7 redundant places. [2020-10-16 04:51:47,666 INFO L241 Difference]: Finished difference. Result has 87 places, 100 transitions, 1012 flow [2020-10-16 04:51:47,666 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1012, PETRI_PLACES=87, PETRI_TRANSITIONS=100} [2020-10-16 04:51:47,666 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2020-10-16 04:51:47,667 INFO L481 AbstractCegarLoop]: Abstraction has has 87 places, 100 transitions, 1012 flow [2020-10-16 04:51:47,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:47,667 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:47,667 INFO L255 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] [2020-10-16 04:51:47,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:51:47,667 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash 377975205, now seen corresponding path program 1 times [2020-10-16 04:51:47,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:47,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217424234] [2020-10-16 04:51:47,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:48,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217424234] [2020-10-16 04:51:48,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:48,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:51:48,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436109470] [2020-10-16 04:51:48,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:51:48,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:48,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:51:48,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:51:48,179 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 205 [2020-10-16 04:51:48,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 100 transitions, 1012 flow. Second operand 10 states. [2020-10-16 04:51:48,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:48,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 205 [2020-10-16 04:51:48,180 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:48,885 INFO L129 PetriNetUnfolder]: 963/2134 cut-off events. [2020-10-16 04:51:48,885 INFO L130 PetriNetUnfolder]: For 20405/22830 co-relation queries the response was YES. [2020-10-16 04:51:48,897 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11780 conditions, 2134 events. 963/2134 cut-off events. For 20405/22830 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 17344 event pairs, 38 based on Foata normal form. 329/2304 useless extension candidates. Maximal degree in co-relation 11744. Up to 679 conditions per place. [2020-10-16 04:51:48,915 INFO L132 encePairwiseOnDemand]: 196/205 looper letters, 57 selfloop transitions, 51 changer transitions 11/169 dead transitions. [2020-10-16 04:51:48,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 169 transitions, 2128 flow [2020-10-16 04:51:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:51:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:51:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1403 transitions. [2020-10-16 04:51:48,920 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7604336043360433 [2020-10-16 04:51:48,920 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1403 transitions. [2020-10-16 04:51:48,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1403 transitions. [2020-10-16 04:51:48,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:48,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1403 transitions. [2020-10-16 04:51:48,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:51:48,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:51:48,927 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:51:48,928 INFO L185 Difference]: Start difference. First operand has 87 places, 100 transitions, 1012 flow. Second operand 9 states and 1403 transitions. [2020-10-16 04:51:48,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 169 transitions, 2128 flow [2020-10-16 04:51:49,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 169 transitions, 2031 flow, removed 34 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:49,058 INFO L241 Difference]: Finished difference. Result has 97 places, 131 transitions, 1545 flow [2020-10-16 04:51:49,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1545, PETRI_PLACES=97, PETRI_TRANSITIONS=131} [2020-10-16 04:51:49,058 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2020-10-16 04:51:49,058 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 131 transitions, 1545 flow [2020-10-16 04:51:49,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:51:49,058 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:49,059 INFO L255 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] [2020-10-16 04:51:49,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:51:49,059 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1049618047, now seen corresponding path program 2 times [2020-10-16 04:51:49,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:49,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013049630] [2020-10-16 04:51:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:49,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013049630] [2020-10-16 04:51:49,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:49,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:49,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11464866] [2020-10-16 04:51:49,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:49,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:49,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:49,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:49,167 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 205 [2020-10-16 04:51:49,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 131 transitions, 1545 flow. Second operand 7 states. [2020-10-16 04:51:49,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:49,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 205 [2020-10-16 04:51:49,168 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:49,768 INFO L129 PetriNetUnfolder]: 1487/3424 cut-off events. [2020-10-16 04:51:49,768 INFO L130 PetriNetUnfolder]: For 31297/33585 co-relation queries the response was YES. [2020-10-16 04:51:49,787 INFO L80 FinitePrefix]: Finished finitePrefix Result has 17540 conditions, 3424 events. 1487/3424 cut-off events. For 31297/33585 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 31939 event pairs, 79 based on Foata normal form. 435/3565 useless extension candidates. Maximal degree in co-relation 17497. Up to 765 conditions per place. [2020-10-16 04:51:49,811 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 101 selfloop transitions, 16 changer transitions 9/176 dead transitions. [2020-10-16 04:51:49,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 176 transitions, 2505 flow [2020-10-16 04:51:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1133 transitions. [2020-10-16 04:51:49,815 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7895470383275262 [2020-10-16 04:51:49,816 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1133 transitions. [2020-10-16 04:51:49,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1133 transitions. [2020-10-16 04:51:49,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:49,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1133 transitions. [2020-10-16 04:51:49,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:49,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:49,821 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:49,822 INFO L185 Difference]: Start difference. First operand has 97 places, 131 transitions, 1545 flow. Second operand 7 states and 1133 transitions. [2020-10-16 04:51:49,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 176 transitions, 2505 flow [2020-10-16 04:51:50,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 176 transitions, 2453 flow, removed 24 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:50,110 INFO L241 Difference]: Finished difference. Result has 101 places, 133 transitions, 1574 flow [2020-10-16 04:51:50,111 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1574, PETRI_PLACES=101, PETRI_TRANSITIONS=133} [2020-10-16 04:51:50,111 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2020-10-16 04:51:50,111 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 133 transitions, 1574 flow [2020-10-16 04:51:50,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:50,111 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:50,111 INFO L255 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] [2020-10-16 04:51:50,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:51:50,112 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1988837157, now seen corresponding path program 3 times [2020-10-16 04:51:50,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:50,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693962900] [2020-10-16 04:51:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:50,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693962900] [2020-10-16 04:51:50,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:50,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:51:50,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160849349] [2020-10-16 04:51:50,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:50,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:50,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:50,202 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 205 [2020-10-16 04:51:50,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 133 transitions, 1574 flow. Second operand 7 states. [2020-10-16 04:51:50,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:50,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 205 [2020-10-16 04:51:50,203 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:50,733 INFO L129 PetriNetUnfolder]: 1298/2998 cut-off events. [2020-10-16 04:51:50,733 INFO L130 PetriNetUnfolder]: For 24600/32844 co-relation queries the response was YES. [2020-10-16 04:51:50,754 INFO L80 FinitePrefix]: Finished finitePrefix Result has 15927 conditions, 2998 events. 1298/2998 cut-off events. For 24600/32844 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 27622 event pairs, 55 based on Foata normal form. 2382/5128 useless extension candidates. Maximal degree in co-relation 15883. Up to 735 conditions per place. [2020-10-16 04:51:50,765 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 2 selfloop transitions, 33 changer transitions 26/136 dead transitions. [2020-10-16 04:51:50,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 136 transitions, 1679 flow [2020-10-16 04:51:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:51:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:51:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1900 transitions. [2020-10-16 04:51:50,771 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8425720620842572 [2020-10-16 04:51:50,771 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1900 transitions. [2020-10-16 04:51:50,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1900 transitions. [2020-10-16 04:51:50,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:50,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1900 transitions. [2020-10-16 04:51:50,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:51:50,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:51:50,779 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:51:50,779 INFO L185 Difference]: Start difference. First operand has 101 places, 133 transitions, 1574 flow. Second operand 11 states and 1900 transitions. [2020-10-16 04:51:50,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 136 transitions, 1679 flow [2020-10-16 04:51:51,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 136 transitions, 1550 flow, removed 41 selfloop flow, removed 5 redundant places. [2020-10-16 04:51:51,020 INFO L241 Difference]: Finished difference. Result has 108 places, 110 transitions, 1191 flow [2020-10-16 04:51:51,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1191, PETRI_PLACES=108, PETRI_TRANSITIONS=110} [2020-10-16 04:51:51,020 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places. [2020-10-16 04:51:51,020 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 110 transitions, 1191 flow [2020-10-16 04:51:51,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:51,021 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:51,021 INFO L255 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] [2020-10-16 04:51:51,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:51:51,021 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:51,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:51,021 INFO L82 PathProgramCache]: Analyzing trace with hash -592245123, now seen corresponding path program 1 times [2020-10-16 04:51:51,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:51,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092385777] [2020-10-16 04:51:51,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:51,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092385777] [2020-10-16 04:51:51,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:51,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 04:51:51,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931814554] [2020-10-16 04:51:51,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 04:51:51,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 04:51:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-16 04:51:51,252 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 205 [2020-10-16 04:51:51,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 110 transitions, 1191 flow. Second operand 12 states. [2020-10-16 04:51:51,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:51,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 205 [2020-10-16 04:51:51,253 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:52,872 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1057] L745-->L752: Formula: (let ((.cse13 (= (mod v_~x$w_buff0_used~0_470 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd1~0_68 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_320 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_469 256) 0))) (let ((.cse2 (not .cse4)) (.cse9 (not .cse14)) (.cse1 (not .cse5)) (.cse8 (or .cse5 .cse14)) (.cse11 (or .cse12 .cse4)) (.cse6 (not .cse12)) (.cse7 (not .cse13)) (.cse10 (or .cse12 .cse13))) (and (let ((.cse3 (= (mod v_~x$r_buff0_thd1~0_67 256) 0)) (.cse0 (= (mod v_~x$w_buff1_used~0_319 256) 0))) (or (and (or (and (not .cse0) .cse1) (and .cse2 (not .cse3))) (= v_~x$r_buff1_thd1~0_49 0)) (and (or .cse4 .cse3) (= v_~x$r_buff1_thd1~0_49 v_~x$r_buff1_thd1~0_50) (or .cse0 .cse5)))) (or (and .cse6 .cse7 (= v_~x~0_153 v_~x$w_buff0~0_93) (= |v_P0_#t~ite2_48| |v_P0Thread1of1ForFork0_#t~ite2_1|)) (and (or (and .cse8 (= |v_P0_#t~ite2_48| v_~x~0_154)) (and .cse9 (= |v_P0_#t~ite2_48| v_~x$w_buff1~0_98) .cse1)) (= |v_P0_#t~ite2_48| v_~x~0_153) .cse10)) (or (and .cse6 .cse2 (= v_~x$r_buff0_thd1~0_67 0)) (and (= v_~x$r_buff0_thd1~0_68 v_~x$r_buff0_thd1~0_67) .cse11)) (or (and (= v_~x$w_buff1_used~0_319 0) (or (and .cse6 .cse2) (and .cse9 .cse1))) (and .cse8 (= v_~x$w_buff1_used~0_319 v_~x$w_buff1_used~0_320) .cse11)) (or (and .cse6 .cse7 (= v_~x$w_buff0_used~0_469 0)) (and .cse10 (= v_~x$w_buff0_used~0_469 v_~x$w_buff0_used~0_470)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_320, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#t~ite2=|v_P0Thread1of1ForFork0_#t~ite2_1|, ~x~0=v_~x~0_154, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_470} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_319, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_469, P0Thread1of1ForFork0_#t~ite5=|v_P0Thread1of1ForFork0_#t~ite5_1|, P0Thread1of1ForFork0_#t~ite6=|v_P0Thread1of1ForFork0_#t~ite6_1|, P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_1|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_1|, P0Thread1of1ForFork0_#t~ite7=|v_P0Thread1of1ForFork0_#t~ite7_1|, P0Thread1of1ForFork0_#t~ite2=|v_P0Thread1of1ForFork0_#t~ite2_2|, ~x~0=v_~x~0_153} AuxVars[|v_P0_#t~ite2_48|] AssignedVars[P0Thread1of1ForFork0_#t~ite5, P0Thread1of1ForFork0_#t~ite6, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, P0Thread1of1ForFork0_#t~ite7, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite2, ~x~0, ~x$w_buff0_used~0][53], [8#L752true, Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), 12#L852-1true, Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), 283#(<= ~__unbuffered_cnt~0 1), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 353#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 103#L775true, 44#P2EXITtrue, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), P2Thread1of1ForFork2InUse, 59#L821true, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:51:52,873 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2020-10-16 04:51:52,873 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:52,873 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:52,873 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:52,873 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1081] L821-->L828: Formula: (let ((.cse1 (= (mod v_~x$w_buff0_used~0_425 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_280 256) 0)) (.cse2 (= (mod v_~x$r_buff1_thd4~0_48 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd4~0_70 256) 0)) (.cse14 (= (mod v_~x$w_buff0_used~0_426 256) 0))) (let ((.cse11 (not .cse14)) (.cse10 (or .cse12 .cse14)) (.cse8 (or .cse13 .cse2)) (.cse5 (not .cse2)) (.cse6 (not .cse13)) (.cse7 (not .cse12)) (.cse4 (not .cse1)) (.cse9 (or .cse12 .cse1))) (and (let ((.cse0 (= 0 (mod v_~x$r_buff0_thd4~0_69 256))) (.cse3 (= (mod v_~x$w_buff1_used~0_279 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= v_~x$r_buff1_thd4~0_48 v_~x$r_buff1_thd4~0_47)) (and (or (and (not .cse0) .cse4) (and .cse5 (not .cse3))) (= v_~x$r_buff1_thd4~0_47 0)))) (or (and (or (and .cse5 .cse6) (and .cse7 .cse4)) (= v_~x$w_buff1_used~0_279 0)) (and .cse8 (= v_~x$w_buff1_used~0_279 v_~x$w_buff1_used~0_280) .cse9)) (or (and .cse10 (= v_~x$w_buff0_used~0_426 v_~x$w_buff0_used~0_425)) (and .cse7 .cse11 (= v_~x$w_buff0_used~0_425 0))) (or (and .cse7 .cse11 (= |v_P3Thread1of1ForFork3_#t~ite20_1| |v_P3_#t~ite20_30|) (= v_~x~0_133 v_~x$w_buff0~0_77)) (and (= |v_P3_#t~ite20_30| v_~x~0_133) .cse10 (or (and (= |v_P3_#t~ite20_30| v_~x~0_134) .cse8) (and .cse5 .cse6 (= |v_P3_#t~ite20_30| v_~x$w_buff1~0_78))))) (or (and .cse7 .cse4 (= v_~x$r_buff0_thd4~0_69 0)) (and (= v_~x$r_buff0_thd4~0_69 v_~x$r_buff0_thd4~0_70) .cse9))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_280, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_70, P3Thread1of1ForFork3_#t~ite20=|v_P3Thread1of1ForFork3_#t~ite20_1|, ~x~0=v_~x~0_134, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_426} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_279, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_69, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_425, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite24=|v_P3Thread1of1ForFork3_#t~ite24_1|, P3Thread1of1ForFork3_#t~ite23=|v_P3Thread1of1ForFork3_#t~ite23_1|, P3Thread1of1ForFork3_#t~ite22=|v_P3Thread1of1ForFork3_#t~ite22_1|, P3Thread1of1ForFork3_#t~ite21=|v_P3Thread1of1ForFork3_#t~ite21_1|, P3Thread1of1ForFork3_#t~ite20=|v_P3Thread1of1ForFork3_#t~ite20_2|, ~x~0=v_~x~0_133} AuxVars[|v_P3_#t~ite20_30|] AssignedVars[P3Thread1of1ForFork3_#t~ite25, P3Thread1of1ForFork3_#t~ite24, ~x$w_buff1_used~0, P3Thread1of1ForFork3_#t~ite23, P3Thread1of1ForFork3_#t~ite22, ~x$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite21, P3Thread1of1ForFork3_#t~ite20, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][107], [Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), 12#L852-1true, Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), 283#(<= ~__unbuffered_cnt~0 1), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 353#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 103#L775true, 44#P2EXITtrue, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 50#L828true, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 56#L745true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:51:52,874 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2020-10-16 04:51:52,874 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:52,874 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:52,874 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,160 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L795-->L802: Formula: (let ((.cse14 (= (mod v_~x$w_buff1_used~0_328 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd3~0_50 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_478 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd3~0_72 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_477 256) 0))) (let ((.cse0 (not .cse4)) (.cse7 (or .cse4 .cse13)) (.cse10 (not .cse12)) (.cse6 (not .cse13)) (.cse2 (not .cse5)) (.cse8 (not .cse14)) (.cse9 (or .cse5 .cse14)) (.cse11 (or .cse12 .cse13))) (and (let ((.cse1 (= (mod v_~x$r_buff0_thd3~0_71 256) 0)) (.cse3 (= (mod v_~x$w_buff1_used~0_327 256) 0))) (or (and (or (and .cse0 (not .cse1)) (and .cse2 (not .cse3))) (= v_~x$r_buff1_thd3~0_49 0)) (and (or .cse1 .cse4) (= v_~x$r_buff1_thd3~0_49 v_~x$r_buff1_thd3~0_50) (or .cse5 .cse3)))) (or (and .cse0 (= v_~x$r_buff0_thd3~0_71 0) .cse6) (and (= v_~x$r_buff0_thd3~0_72 v_~x$r_buff0_thd3~0_71) .cse7)) (or (and (= v_~x$w_buff1_used~0_327 0) (or (and .cse2 .cse8) (and .cse0 .cse6))) (and .cse9 .cse7 (= v_~x$w_buff1_used~0_328 v_~x$w_buff1_used~0_327))) (or (and (= v_~x$w_buff0_used~0_477 0) .cse10 .cse6) (and .cse11 (= v_~x$w_buff0_used~0_477 v_~x$w_buff0_used~0_478))) (or (and (= v_~x~0_161 v_~x$w_buff0~0_95) (= |v_P2Thread1of1ForFork2_#t~ite14_1| |v_P2_#t~ite14_30|) .cse10 .cse6) (and (= |v_P2_#t~ite14_30| v_~x~0_161) (or (and .cse2 .cse8 (= |v_P2_#t~ite14_30| v_~x$w_buff1~0_104)) (and (= |v_P2_#t~ite14_30| v_~x~0_162) .cse9)) .cse11))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, P2Thread1of1ForFork2_#t~ite14=|v_P2Thread1of1ForFork2_#t~ite14_1|, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_328, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_72, ~x~0=v_~x~0_162, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_478} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_327, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_477, P2Thread1of1ForFork2_#t~ite14=|v_P2Thread1of1ForFork2_#t~ite14_2|, P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_1|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_1|, P2Thread1of1ForFork2_#t~ite17=|v_P2Thread1of1ForFork2_#t~ite17_1|, ~x~0=v_~x~0_161, P2Thread1of1ForFork2_#t~ite18=|v_P2Thread1of1ForFork2_#t~ite18_1|, P2Thread1of1ForFork2_#t~ite19=|v_P2Thread1of1ForFork2_#t~ite19_1|} AuxVars[|v_P2_#t~ite14_30|] AssignedVars[P2Thread1of1ForFork2_#t~ite14, P2Thread1of1ForFork2_#t~ite15, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite16, P2Thread1of1ForFork2_#t~ite17, ~x~0, P2Thread1of1ForFork2_#t~ite18, ~x$w_buff0_used~0, P2Thread1of1ForFork2_#t~ite19][58], [Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), 12#L852-1true, Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 336#(<= ~x$w_buff0~0 0), 283#(<= ~__unbuffered_cnt~0 1), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 353#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 100#L802true, Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 103#L775true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 52#P0EXITtrue, Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 59#L821true, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0))]) [2020-10-16 04:51:53,160 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,160 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,160 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,160 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,204 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1057] L745-->L752: Formula: (let ((.cse13 (= (mod v_~x$w_buff0_used~0_470 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd1~0_68 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_320 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_469 256) 0))) (let ((.cse2 (not .cse4)) (.cse9 (not .cse14)) (.cse1 (not .cse5)) (.cse8 (or .cse5 .cse14)) (.cse11 (or .cse12 .cse4)) (.cse6 (not .cse12)) (.cse7 (not .cse13)) (.cse10 (or .cse12 .cse13))) (and (let ((.cse3 (= (mod v_~x$r_buff0_thd1~0_67 256) 0)) (.cse0 (= (mod v_~x$w_buff1_used~0_319 256) 0))) (or (and (or (and (not .cse0) .cse1) (and .cse2 (not .cse3))) (= v_~x$r_buff1_thd1~0_49 0)) (and (or .cse4 .cse3) (= v_~x$r_buff1_thd1~0_49 v_~x$r_buff1_thd1~0_50) (or .cse0 .cse5)))) (or (and .cse6 .cse7 (= v_~x~0_153 v_~x$w_buff0~0_93) (= |v_P0_#t~ite2_48| |v_P0Thread1of1ForFork0_#t~ite2_1|)) (and (or (and .cse8 (= |v_P0_#t~ite2_48| v_~x~0_154)) (and .cse9 (= |v_P0_#t~ite2_48| v_~x$w_buff1~0_98) .cse1)) (= |v_P0_#t~ite2_48| v_~x~0_153) .cse10)) (or (and .cse6 .cse2 (= v_~x$r_buff0_thd1~0_67 0)) (and (= v_~x$r_buff0_thd1~0_68 v_~x$r_buff0_thd1~0_67) .cse11)) (or (and (= v_~x$w_buff1_used~0_319 0) (or (and .cse6 .cse2) (and .cse9 .cse1))) (and .cse8 (= v_~x$w_buff1_used~0_319 v_~x$w_buff1_used~0_320) .cse11)) (or (and .cse6 .cse7 (= v_~x$w_buff0_used~0_469 0)) (and .cse10 (= v_~x$w_buff0_used~0_469 v_~x$w_buff0_used~0_470)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_320, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#t~ite2=|v_P0Thread1of1ForFork0_#t~ite2_1|, ~x~0=v_~x~0_154, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_470} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_319, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_469, P0Thread1of1ForFork0_#t~ite5=|v_P0Thread1of1ForFork0_#t~ite5_1|, P0Thread1of1ForFork0_#t~ite6=|v_P0Thread1of1ForFork0_#t~ite6_1|, P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_1|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_1|, P0Thread1of1ForFork0_#t~ite7=|v_P0Thread1of1ForFork0_#t~ite7_1|, P0Thread1of1ForFork0_#t~ite2=|v_P0Thread1of1ForFork0_#t~ite2_2|, ~x~0=v_~x~0_153} AuxVars[|v_P0_#t~ite2_48|] AssignedVars[P0Thread1of1ForFork0_#t~ite5, P0Thread1of1ForFork0_#t~ite6, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, P0Thread1of1ForFork0_#t~ite7, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite2, ~x~0, ~x$w_buff0_used~0][53], [8#L752true, Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 358#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 103#L775true, 44#P2EXITtrue, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 117#L2true, 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, 59#L821true, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:51:53,204 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,205 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,205 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,205 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,205 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1081] L821-->L828: Formula: (let ((.cse1 (= (mod v_~x$w_buff0_used~0_425 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_280 256) 0)) (.cse2 (= (mod v_~x$r_buff1_thd4~0_48 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd4~0_70 256) 0)) (.cse14 (= (mod v_~x$w_buff0_used~0_426 256) 0))) (let ((.cse11 (not .cse14)) (.cse10 (or .cse12 .cse14)) (.cse8 (or .cse13 .cse2)) (.cse5 (not .cse2)) (.cse6 (not .cse13)) (.cse7 (not .cse12)) (.cse4 (not .cse1)) (.cse9 (or .cse12 .cse1))) (and (let ((.cse0 (= 0 (mod v_~x$r_buff0_thd4~0_69 256))) (.cse3 (= (mod v_~x$w_buff1_used~0_279 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= v_~x$r_buff1_thd4~0_48 v_~x$r_buff1_thd4~0_47)) (and (or (and (not .cse0) .cse4) (and .cse5 (not .cse3))) (= v_~x$r_buff1_thd4~0_47 0)))) (or (and (or (and .cse5 .cse6) (and .cse7 .cse4)) (= v_~x$w_buff1_used~0_279 0)) (and .cse8 (= v_~x$w_buff1_used~0_279 v_~x$w_buff1_used~0_280) .cse9)) (or (and .cse10 (= v_~x$w_buff0_used~0_426 v_~x$w_buff0_used~0_425)) (and .cse7 .cse11 (= v_~x$w_buff0_used~0_425 0))) (or (and .cse7 .cse11 (= |v_P3Thread1of1ForFork3_#t~ite20_1| |v_P3_#t~ite20_30|) (= v_~x~0_133 v_~x$w_buff0~0_77)) (and (= |v_P3_#t~ite20_30| v_~x~0_133) .cse10 (or (and (= |v_P3_#t~ite20_30| v_~x~0_134) .cse8) (and .cse5 .cse6 (= |v_P3_#t~ite20_30| v_~x$w_buff1~0_78))))) (or (and .cse7 .cse4 (= v_~x$r_buff0_thd4~0_69 0)) (and (= v_~x$r_buff0_thd4~0_69 v_~x$r_buff0_thd4~0_70) .cse9))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_280, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_70, P3Thread1of1ForFork3_#t~ite20=|v_P3Thread1of1ForFork3_#t~ite20_1|, ~x~0=v_~x~0_134, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_426} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_279, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_69, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_425, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite24=|v_P3Thread1of1ForFork3_#t~ite24_1|, P3Thread1of1ForFork3_#t~ite23=|v_P3Thread1of1ForFork3_#t~ite23_1|, P3Thread1of1ForFork3_#t~ite22=|v_P3Thread1of1ForFork3_#t~ite22_1|, P3Thread1of1ForFork3_#t~ite21=|v_P3Thread1of1ForFork3_#t~ite21_1|, P3Thread1of1ForFork3_#t~ite20=|v_P3Thread1of1ForFork3_#t~ite20_2|, ~x~0=v_~x~0_133} AuxVars[|v_P3_#t~ite20_30|] AssignedVars[P3Thread1of1ForFork3_#t~ite25, P3Thread1of1ForFork3_#t~ite24, ~x$w_buff1_used~0, P3Thread1of1ForFork3_#t~ite23, P3Thread1of1ForFork3_#t~ite22, ~x$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite21, P3Thread1of1ForFork3_#t~ite20, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][107], [Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 358#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 103#L775true, 44#P2EXITtrue, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 50#L828true, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 117#L2true, 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 56#L745true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:51:53,205 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,205 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,205 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,206 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,216 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1057] L745-->L752: Formula: (let ((.cse13 (= (mod v_~x$w_buff0_used~0_470 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd1~0_68 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_320 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_469 256) 0))) (let ((.cse2 (not .cse4)) (.cse9 (not .cse14)) (.cse1 (not .cse5)) (.cse8 (or .cse5 .cse14)) (.cse11 (or .cse12 .cse4)) (.cse6 (not .cse12)) (.cse7 (not .cse13)) (.cse10 (or .cse12 .cse13))) (and (let ((.cse3 (= (mod v_~x$r_buff0_thd1~0_67 256) 0)) (.cse0 (= (mod v_~x$w_buff1_used~0_319 256) 0))) (or (and (or (and (not .cse0) .cse1) (and .cse2 (not .cse3))) (= v_~x$r_buff1_thd1~0_49 0)) (and (or .cse4 .cse3) (= v_~x$r_buff1_thd1~0_49 v_~x$r_buff1_thd1~0_50) (or .cse0 .cse5)))) (or (and .cse6 .cse7 (= v_~x~0_153 v_~x$w_buff0~0_93) (= |v_P0_#t~ite2_48| |v_P0Thread1of1ForFork0_#t~ite2_1|)) (and (or (and .cse8 (= |v_P0_#t~ite2_48| v_~x~0_154)) (and .cse9 (= |v_P0_#t~ite2_48| v_~x$w_buff1~0_98) .cse1)) (= |v_P0_#t~ite2_48| v_~x~0_153) .cse10)) (or (and .cse6 .cse2 (= v_~x$r_buff0_thd1~0_67 0)) (and (= v_~x$r_buff0_thd1~0_68 v_~x$r_buff0_thd1~0_67) .cse11)) (or (and (= v_~x$w_buff1_used~0_319 0) (or (and .cse6 .cse2) (and .cse9 .cse1))) (and .cse8 (= v_~x$w_buff1_used~0_319 v_~x$w_buff1_used~0_320) .cse11)) (or (and .cse6 .cse7 (= v_~x$w_buff0_used~0_469 0)) (and .cse10 (= v_~x$w_buff0_used~0_469 v_~x$w_buff0_used~0_470)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_320, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#t~ite2=|v_P0Thread1of1ForFork0_#t~ite2_1|, ~x~0=v_~x~0_154, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_470} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_319, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_469, P0Thread1of1ForFork0_#t~ite5=|v_P0Thread1of1ForFork0_#t~ite5_1|, P0Thread1of1ForFork0_#t~ite6=|v_P0Thread1of1ForFork0_#t~ite6_1|, P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_1|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_1|, P0Thread1of1ForFork0_#t~ite7=|v_P0Thread1of1ForFork0_#t~ite7_1|, P0Thread1of1ForFork0_#t~ite2=|v_P0Thread1of1ForFork0_#t~ite2_2|, ~x~0=v_~x~0_153} AuxVars[|v_P0_#t~ite2_48|] AssignedVars[P0Thread1of1ForFork0_#t~ite5, P0Thread1of1ForFork0_#t~ite6, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, P0Thread1of1ForFork0_#t~ite7, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite2, ~x~0, ~x$w_buff0_used~0][53], [8#L752true, Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 336#(<= ~x$w_buff0~0 0), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 358#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 103#L775true, 44#P2EXITtrue, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 117#L2true, 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 59#L821true, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:51:53,216 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,216 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,216 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,216 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,217 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1057] L745-->L752: Formula: (let ((.cse13 (= (mod v_~x$w_buff0_used~0_470 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd1~0_68 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_320 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_469 256) 0))) (let ((.cse2 (not .cse4)) (.cse9 (not .cse14)) (.cse1 (not .cse5)) (.cse8 (or .cse5 .cse14)) (.cse11 (or .cse12 .cse4)) (.cse6 (not .cse12)) (.cse7 (not .cse13)) (.cse10 (or .cse12 .cse13))) (and (let ((.cse3 (= (mod v_~x$r_buff0_thd1~0_67 256) 0)) (.cse0 (= (mod v_~x$w_buff1_used~0_319 256) 0))) (or (and (or (and (not .cse0) .cse1) (and .cse2 (not .cse3))) (= v_~x$r_buff1_thd1~0_49 0)) (and (or .cse4 .cse3) (= v_~x$r_buff1_thd1~0_49 v_~x$r_buff1_thd1~0_50) (or .cse0 .cse5)))) (or (and .cse6 .cse7 (= v_~x~0_153 v_~x$w_buff0~0_93) (= |v_P0_#t~ite2_48| |v_P0Thread1of1ForFork0_#t~ite2_1|)) (and (or (and .cse8 (= |v_P0_#t~ite2_48| v_~x~0_154)) (and .cse9 (= |v_P0_#t~ite2_48| v_~x$w_buff1~0_98) .cse1)) (= |v_P0_#t~ite2_48| v_~x~0_153) .cse10)) (or (and .cse6 .cse2 (= v_~x$r_buff0_thd1~0_67 0)) (and (= v_~x$r_buff0_thd1~0_68 v_~x$r_buff0_thd1~0_67) .cse11)) (or (and (= v_~x$w_buff1_used~0_319 0) (or (and .cse6 .cse2) (and .cse9 .cse1))) (and .cse8 (= v_~x$w_buff1_used~0_319 v_~x$w_buff1_used~0_320) .cse11)) (or (and .cse6 .cse7 (= v_~x$w_buff0_used~0_469 0)) (and .cse10 (= v_~x$w_buff0_used~0_469 v_~x$w_buff0_used~0_470)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_320, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#t~ite2=|v_P0Thread1of1ForFork0_#t~ite2_1|, ~x~0=v_~x~0_154, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_470} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_319, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_469, P0Thread1of1ForFork0_#t~ite5=|v_P0Thread1of1ForFork0_#t~ite5_1|, P0Thread1of1ForFork0_#t~ite6=|v_P0Thread1of1ForFork0_#t~ite6_1|, P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_1|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_1|, P0Thread1of1ForFork0_#t~ite7=|v_P0Thread1of1ForFork0_#t~ite7_1|, P0Thread1of1ForFork0_#t~ite2=|v_P0Thread1of1ForFork0_#t~ite2_2|, ~x~0=v_~x~0_153} AuxVars[|v_P0_#t~ite2_48|] AssignedVars[P0Thread1of1ForFork0_#t~ite5, P0Thread1of1ForFork0_#t~ite6, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, P0Thread1of1ForFork0_#t~ite7, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite2, ~x~0, ~x$w_buff0_used~0][53], [Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), 8#L752true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 336#(<= ~x$w_buff0~0 0), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 95#L772true, Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 358#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 44#P2EXITtrue, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 117#L2true, 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 59#L821true, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:51:53,217 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,217 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,217 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,217 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,217 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1081] L821-->L828: Formula: (let ((.cse1 (= (mod v_~x$w_buff0_used~0_425 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_280 256) 0)) (.cse2 (= (mod v_~x$r_buff1_thd4~0_48 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd4~0_70 256) 0)) (.cse14 (= (mod v_~x$w_buff0_used~0_426 256) 0))) (let ((.cse11 (not .cse14)) (.cse10 (or .cse12 .cse14)) (.cse8 (or .cse13 .cse2)) (.cse5 (not .cse2)) (.cse6 (not .cse13)) (.cse7 (not .cse12)) (.cse4 (not .cse1)) (.cse9 (or .cse12 .cse1))) (and (let ((.cse0 (= 0 (mod v_~x$r_buff0_thd4~0_69 256))) (.cse3 (= (mod v_~x$w_buff1_used~0_279 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= v_~x$r_buff1_thd4~0_48 v_~x$r_buff1_thd4~0_47)) (and (or (and (not .cse0) .cse4) (and .cse5 (not .cse3))) (= v_~x$r_buff1_thd4~0_47 0)))) (or (and (or (and .cse5 .cse6) (and .cse7 .cse4)) (= v_~x$w_buff1_used~0_279 0)) (and .cse8 (= v_~x$w_buff1_used~0_279 v_~x$w_buff1_used~0_280) .cse9)) (or (and .cse10 (= v_~x$w_buff0_used~0_426 v_~x$w_buff0_used~0_425)) (and .cse7 .cse11 (= v_~x$w_buff0_used~0_425 0))) (or (and .cse7 .cse11 (= |v_P3Thread1of1ForFork3_#t~ite20_1| |v_P3_#t~ite20_30|) (= v_~x~0_133 v_~x$w_buff0~0_77)) (and (= |v_P3_#t~ite20_30| v_~x~0_133) .cse10 (or (and (= |v_P3_#t~ite20_30| v_~x~0_134) .cse8) (and .cse5 .cse6 (= |v_P3_#t~ite20_30| v_~x$w_buff1~0_78))))) (or (and .cse7 .cse4 (= v_~x$r_buff0_thd4~0_69 0)) (and (= v_~x$r_buff0_thd4~0_69 v_~x$r_buff0_thd4~0_70) .cse9))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_280, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_70, P3Thread1of1ForFork3_#t~ite20=|v_P3Thread1of1ForFork3_#t~ite20_1|, ~x~0=v_~x~0_134, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_426} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_279, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_69, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_425, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite24=|v_P3Thread1of1ForFork3_#t~ite24_1|, P3Thread1of1ForFork3_#t~ite23=|v_P3Thread1of1ForFork3_#t~ite23_1|, P3Thread1of1ForFork3_#t~ite22=|v_P3Thread1of1ForFork3_#t~ite22_1|, P3Thread1of1ForFork3_#t~ite21=|v_P3Thread1of1ForFork3_#t~ite21_1|, P3Thread1of1ForFork3_#t~ite20=|v_P3Thread1of1ForFork3_#t~ite20_2|, ~x~0=v_~x~0_133} AuxVars[|v_P3_#t~ite20_30|] AssignedVars[P3Thread1of1ForFork3_#t~ite25, P3Thread1of1ForFork3_#t~ite24, ~x$w_buff1_used~0, P3Thread1of1ForFork3_#t~ite23, P3Thread1of1ForFork3_#t~ite22, ~x$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite21, P3Thread1of1ForFork3_#t~ite20, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][107], [Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 336#(<= ~x$w_buff0~0 0), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 358#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 103#L775true, 44#P2EXITtrue, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 50#L828true, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 117#L2true, 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 56#L745true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:51:53,217 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,217 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,218 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,218 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,218 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1081] L821-->L828: Formula: (let ((.cse1 (= (mod v_~x$w_buff0_used~0_425 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_280 256) 0)) (.cse2 (= (mod v_~x$r_buff1_thd4~0_48 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd4~0_70 256) 0)) (.cse14 (= (mod v_~x$w_buff0_used~0_426 256) 0))) (let ((.cse11 (not .cse14)) (.cse10 (or .cse12 .cse14)) (.cse8 (or .cse13 .cse2)) (.cse5 (not .cse2)) (.cse6 (not .cse13)) (.cse7 (not .cse12)) (.cse4 (not .cse1)) (.cse9 (or .cse12 .cse1))) (and (let ((.cse0 (= 0 (mod v_~x$r_buff0_thd4~0_69 256))) (.cse3 (= (mod v_~x$w_buff1_used~0_279 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= v_~x$r_buff1_thd4~0_48 v_~x$r_buff1_thd4~0_47)) (and (or (and (not .cse0) .cse4) (and .cse5 (not .cse3))) (= v_~x$r_buff1_thd4~0_47 0)))) (or (and (or (and .cse5 .cse6) (and .cse7 .cse4)) (= v_~x$w_buff1_used~0_279 0)) (and .cse8 (= v_~x$w_buff1_used~0_279 v_~x$w_buff1_used~0_280) .cse9)) (or (and .cse10 (= v_~x$w_buff0_used~0_426 v_~x$w_buff0_used~0_425)) (and .cse7 .cse11 (= v_~x$w_buff0_used~0_425 0))) (or (and .cse7 .cse11 (= |v_P3Thread1of1ForFork3_#t~ite20_1| |v_P3_#t~ite20_30|) (= v_~x~0_133 v_~x$w_buff0~0_77)) (and (= |v_P3_#t~ite20_30| v_~x~0_133) .cse10 (or (and (= |v_P3_#t~ite20_30| v_~x~0_134) .cse8) (and .cse5 .cse6 (= |v_P3_#t~ite20_30| v_~x$w_buff1~0_78))))) (or (and .cse7 .cse4 (= v_~x$r_buff0_thd4~0_69 0)) (and (= v_~x$r_buff0_thd4~0_69 v_~x$r_buff0_thd4~0_70) .cse9))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_280, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_70, P3Thread1of1ForFork3_#t~ite20=|v_P3Thread1of1ForFork3_#t~ite20_1|, ~x~0=v_~x~0_134, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_426} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_279, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_69, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_425, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_1|, P3Thread1of1ForFork3_#t~ite24=|v_P3Thread1of1ForFork3_#t~ite24_1|, P3Thread1of1ForFork3_#t~ite23=|v_P3Thread1of1ForFork3_#t~ite23_1|, P3Thread1of1ForFork3_#t~ite22=|v_P3Thread1of1ForFork3_#t~ite22_1|, P3Thread1of1ForFork3_#t~ite21=|v_P3Thread1of1ForFork3_#t~ite21_1|, P3Thread1of1ForFork3_#t~ite20=|v_P3Thread1of1ForFork3_#t~ite20_2|, ~x~0=v_~x~0_133} AuxVars[|v_P3_#t~ite20_30|] AssignedVars[P3Thread1of1ForFork3_#t~ite25, P3Thread1of1ForFork3_#t~ite24, ~x$w_buff1_used~0, P3Thread1of1ForFork3_#t~ite23, P3Thread1of1ForFork3_#t~ite22, ~x$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite21, P3Thread1of1ForFork3_#t~ite20, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][107], [Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 336#(<= ~x$w_buff0~0 0), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 95#L772true, Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 358#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 44#P2EXITtrue, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 50#L828true, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 117#L2true, 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 56#L745true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:51:53,218 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,218 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,218 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,218 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:51:53,572 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L795-->L802: Formula: (let ((.cse14 (= (mod v_~x$w_buff1_used~0_328 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd3~0_50 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_478 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd3~0_72 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_477 256) 0))) (let ((.cse0 (not .cse4)) (.cse7 (or .cse4 .cse13)) (.cse10 (not .cse12)) (.cse6 (not .cse13)) (.cse2 (not .cse5)) (.cse8 (not .cse14)) (.cse9 (or .cse5 .cse14)) (.cse11 (or .cse12 .cse13))) (and (let ((.cse1 (= (mod v_~x$r_buff0_thd3~0_71 256) 0)) (.cse3 (= (mod v_~x$w_buff1_used~0_327 256) 0))) (or (and (or (and .cse0 (not .cse1)) (and .cse2 (not .cse3))) (= v_~x$r_buff1_thd3~0_49 0)) (and (or .cse1 .cse4) (= v_~x$r_buff1_thd3~0_49 v_~x$r_buff1_thd3~0_50) (or .cse5 .cse3)))) (or (and .cse0 (= v_~x$r_buff0_thd3~0_71 0) .cse6) (and (= v_~x$r_buff0_thd3~0_72 v_~x$r_buff0_thd3~0_71) .cse7)) (or (and (= v_~x$w_buff1_used~0_327 0) (or (and .cse2 .cse8) (and .cse0 .cse6))) (and .cse9 .cse7 (= v_~x$w_buff1_used~0_328 v_~x$w_buff1_used~0_327))) (or (and (= v_~x$w_buff0_used~0_477 0) .cse10 .cse6) (and .cse11 (= v_~x$w_buff0_used~0_477 v_~x$w_buff0_used~0_478))) (or (and (= v_~x~0_161 v_~x$w_buff0~0_95) (= |v_P2Thread1of1ForFork2_#t~ite14_1| |v_P2_#t~ite14_30|) .cse10 .cse6) (and (= |v_P2_#t~ite14_30| v_~x~0_161) (or (and .cse2 .cse8 (= |v_P2_#t~ite14_30| v_~x$w_buff1~0_104)) (and (= |v_P2_#t~ite14_30| v_~x~0_162) .cse9)) .cse11))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, P2Thread1of1ForFork2_#t~ite14=|v_P2Thread1of1ForFork2_#t~ite14_1|, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_328, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_72, ~x~0=v_~x~0_162, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_478} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_327, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_477, P2Thread1of1ForFork2_#t~ite14=|v_P2Thread1of1ForFork2_#t~ite14_2|, P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_1|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_1|, P2Thread1of1ForFork2_#t~ite17=|v_P2Thread1of1ForFork2_#t~ite17_1|, ~x~0=v_~x~0_161, P2Thread1of1ForFork2_#t~ite18=|v_P2Thread1of1ForFork2_#t~ite18_1|, P2Thread1of1ForFork2_#t~ite19=|v_P2Thread1of1ForFork2_#t~ite19_1|} AuxVars[|v_P2_#t~ite14_30|] AssignedVars[P2Thread1of1ForFork2_#t~ite14, P2Thread1of1ForFork2_#t~ite15, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite16, P2Thread1of1ForFork2_#t~ite17, ~x~0, P2Thread1of1ForFork2_#t~ite18, ~x$w_buff0_used~0, P2Thread1of1ForFork2_#t~ite19][58], [Black: 320#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 137#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 336#(<= ~x$w_buff0~0 0), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 214#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 342#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (<= ~x$w_buff1~0 0)), 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 100#L802true, Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 358#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (<= ~x$w_buff0~0 0) (= ~x$w_buff1_used~0 0) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 103#L775true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 356#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 178#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 52#P0EXITtrue, 117#L2true, Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 59#L821true, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0))]) [2020-10-16 04:51:53,572 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,572 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,572 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:53,572 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:51:55,786 INFO L129 PetriNetUnfolder]: 13625/20993 cut-off events. [2020-10-16 04:51:55,787 INFO L130 PetriNetUnfolder]: For 327112/330499 co-relation queries the response was YES. [2020-10-16 04:51:55,919 INFO L80 FinitePrefix]: Finished finitePrefix Result has 144043 conditions, 20993 events. 13625/20993 cut-off events. For 327112/330499 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 161031 event pairs, 3113 based on Foata normal form. 1265/21206 useless extension candidates. Maximal degree in co-relation 143997. Up to 12065 conditions per place. [2020-10-16 04:51:55,953 INFO L132 encePairwiseOnDemand]: 195/205 looper letters, 172 selfloop transitions, 51 changer transitions 84/326 dead transitions. [2020-10-16 04:51:55,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 326 transitions, 4625 flow [2020-10-16 04:51:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:51:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:51:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1586 transitions. [2020-10-16 04:51:55,956 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7033259423503326 [2020-10-16 04:51:55,957 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1586 transitions. [2020-10-16 04:51:55,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1586 transitions. [2020-10-16 04:51:55,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:55,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1586 transitions. [2020-10-16 04:51:55,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:51:55,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:51:55,963 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:51:55,963 INFO L185 Difference]: Start difference. First operand has 108 places, 110 transitions, 1191 flow. Second operand 11 states and 1586 transitions. [2020-10-16 04:51:55,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 326 transitions, 4625 flow [2020-10-16 04:51:58,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 326 transitions, 3988 flow, removed 181 selfloop flow, removed 15 redundant places. [2020-10-16 04:51:58,672 INFO L241 Difference]: Finished difference. Result has 110 places, 148 transitions, 1516 flow [2020-10-16 04:51:58,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1516, PETRI_PLACES=110, PETRI_TRANSITIONS=148} [2020-10-16 04:51:58,673 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places. [2020-10-16 04:51:58,673 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 148 transitions, 1516 flow [2020-10-16 04:51:58,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 04:51:58,673 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:58,673 INFO L255 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] [2020-10-16 04:51:58,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 04:51:58,673 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:58,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2004153505, now seen corresponding path program 2 times [2020-10-16 04:51:58,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:58,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037699099] [2020-10-16 04:51:58,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:59,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037699099] [2020-10-16 04:51:59,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:59,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-16 04:51:59,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151884583] [2020-10-16 04:51:59,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-16 04:51:59,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-16 04:51:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-10-16 04:51:59,692 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 205 [2020-10-16 04:51:59,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 148 transitions, 1516 flow. Second operand 16 states. [2020-10-16 04:51:59,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:59,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 205 [2020-10-16 04:51:59,694 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:03,192 INFO L129 PetriNetUnfolder]: 10242/16349 cut-off events. [2020-10-16 04:52:03,192 INFO L130 PetriNetUnfolder]: For 190485/194572 co-relation queries the response was YES. [2020-10-16 04:52:03,292 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106721 conditions, 16349 events. 10242/16349 cut-off events. For 190485/194572 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 129347 event pairs, 479 based on Foata normal form. 983/17186 useless extension candidates. Maximal degree in co-relation 106681. Up to 7625 conditions per place. [2020-10-16 04:52:03,326 INFO L132 encePairwiseOnDemand]: 193/205 looper letters, 204 selfloop transitions, 99 changer transitions 43/366 dead transitions. [2020-10-16 04:52:03,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 366 transitions, 4557 flow [2020-10-16 04:52:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 04:52:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 04:52:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1678 transitions. [2020-10-16 04:52:03,330 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6821138211382114 [2020-10-16 04:52:03,330 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1678 transitions. [2020-10-16 04:52:03,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1678 transitions. [2020-10-16 04:52:03,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:03,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1678 transitions. [2020-10-16 04:52:03,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 04:52:03,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 04:52:03,335 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 04:52:03,335 INFO L185 Difference]: Start difference. First operand has 110 places, 148 transitions, 1516 flow. Second operand 12 states and 1678 transitions. [2020-10-16 04:52:03,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 366 transitions, 4557 flow [2020-10-16 04:52:06,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 366 transitions, 4319 flow, removed 119 selfloop flow, removed 4 redundant places. [2020-10-16 04:52:06,259 INFO L241 Difference]: Finished difference. Result has 121 places, 216 transitions, 2548 flow [2020-10-16 04:52:06,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2548, PETRI_PLACES=121, PETRI_TRANSITIONS=216} [2020-10-16 04:52:06,260 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places. [2020-10-16 04:52:06,260 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 216 transitions, 2548 flow [2020-10-16 04:52:06,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-16 04:52:06,260 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:06,260 INFO L255 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] [2020-10-16 04:52:06,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 04:52:06,260 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:06,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:06,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1123758309, now seen corresponding path program 3 times [2020-10-16 04:52:06,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:06,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326516401] [2020-10-16 04:52:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:06,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326516401] [2020-10-16 04:52:06,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:06,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 04:52:06,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595729904] [2020-10-16 04:52:06,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 04:52:06,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:06,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 04:52:06,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-10-16 04:52:06,826 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 205 [2020-10-16 04:52:06,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 216 transitions, 2548 flow. Second operand 14 states. [2020-10-16 04:52:06,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:06,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 205 [2020-10-16 04:52:06,827 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:10,927 INFO L129 PetriNetUnfolder]: 10392/16838 cut-off events. [2020-10-16 04:52:10,927 INFO L130 PetriNetUnfolder]: For 204159/208269 co-relation queries the response was YES. [2020-10-16 04:52:11,051 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115366 conditions, 16838 events. 10392/16838 cut-off events. For 204159/208269 co-relation queries the response was YES. Maximal size of possible extension queue 1454. Compared 136821 event pairs, 541 based on Foata normal form. 1144/17818 useless extension candidates. Maximal degree in co-relation 115320. Up to 7402 conditions per place. [2020-10-16 04:52:11,084 INFO L132 encePairwiseOnDemand]: 191/205 looper letters, 229 selfloop transitions, 108 changer transitions 37/394 dead transitions. [2020-10-16 04:52:11,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 394 transitions, 5233 flow [2020-10-16 04:52:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 04:52:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 04:52:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1740 transitions. [2020-10-16 04:52:11,087 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2020-10-16 04:52:11,087 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1740 transitions. [2020-10-16 04:52:11,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1740 transitions. [2020-10-16 04:52:11,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:11,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1740 transitions. [2020-10-16 04:52:11,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 04:52:11,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 04:52:11,092 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 04:52:11,092 INFO L185 Difference]: Start difference. First operand has 121 places, 216 transitions, 2548 flow. Second operand 12 states and 1740 transitions. [2020-10-16 04:52:11,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 394 transitions, 5233 flow [2020-10-16 04:52:15,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 394 transitions, 5195 flow, removed 19 selfloop flow, removed 2 redundant places. [2020-10-16 04:52:15,073 INFO L241 Difference]: Finished difference. Result has 134 places, 234 transitions, 3059 flow [2020-10-16 04:52:15,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3059, PETRI_PLACES=134, PETRI_TRANSITIONS=234} [2020-10-16 04:52:15,073 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places. [2020-10-16 04:52:15,074 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 234 transitions, 3059 flow [2020-10-16 04:52:15,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 04:52:15,074 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:15,074 INFO L255 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] [2020-10-16 04:52:15,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 04:52:15,074 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:15,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:15,075 INFO L82 PathProgramCache]: Analyzing trace with hash -589050701, now seen corresponding path program 4 times [2020-10-16 04:52:15,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:15,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596053689] [2020-10-16 04:52:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:15,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596053689] [2020-10-16 04:52:15,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:15,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:15,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436369842] [2020-10-16 04:52:15,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:52:15,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:15,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:52:15,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:52:15,216 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 205 [2020-10-16 04:52:15,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 234 transitions, 3059 flow. Second operand 5 states. [2020-10-16 04:52:15,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:15,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 205 [2020-10-16 04:52:15,221 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:15,625 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), 12#L852-1true, Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 297#(<= ~__unbuffered_cnt~0 2), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 438#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 445#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:15,625 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2020-10-16 04:52:15,625 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:52:15,625 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:52:15,626 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:52:15,803 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 438#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 445#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:15,803 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:52:15,803 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:15,803 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:15,803 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:15,805 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 438#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 445#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:15,805 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:52:15,805 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:15,805 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:15,805 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:16,284 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), 8#L752true, Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), 12#L852-1true, Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 297#(<= ~__unbuffered_cnt~0 2), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 438#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 445#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:16,284 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2020-10-16 04:52:16,285 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2020-10-16 04:52:16,285 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2020-10-16 04:52:16,285 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2020-10-16 04:52:16,358 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), 8#L752true, Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 438#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 445#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:16,358 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2020-10-16 04:52:16,359 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:16,359 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:16,359 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:16,363 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), 8#L752true, Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 438#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 445#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= ~__unbuffered_cnt~0 4) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:16,363 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2020-10-16 04:52:16,363 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:16,363 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:16,363 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:16,447 INFO L129 PetriNetUnfolder]: 4336/10132 cut-off events. [2020-10-16 04:52:16,447 INFO L130 PetriNetUnfolder]: For 112700/116941 co-relation queries the response was YES. [2020-10-16 04:52:16,545 INFO L80 FinitePrefix]: Finished finitePrefix Result has 65240 conditions, 10132 events. 4336/10132 cut-off events. For 112700/116941 co-relation queries the response was YES. Maximal size of possible extension queue 1394. Compared 113462 event pairs, 450 based on Foata normal form. 1082/10778 useless extension candidates. Maximal degree in co-relation 65189. Up to 2557 conditions per place. [2020-10-16 04:52:16,567 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 4 selfloop transitions, 6 changer transitions 38/236 dead transitions. [2020-10-16 04:52:16,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 236 transitions, 3093 flow [2020-10-16 04:52:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:52:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:52:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 888 transitions. [2020-10-16 04:52:16,569 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8663414634146341 [2020-10-16 04:52:16,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 888 transitions. [2020-10-16 04:52:16,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 888 transitions. [2020-10-16 04:52:16,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:16,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 888 transitions. [2020-10-16 04:52:16,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:52:16,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:52:16,571 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:52:16,571 INFO L185 Difference]: Start difference. First operand has 134 places, 234 transitions, 3059 flow. Second operand 5 states and 888 transitions. [2020-10-16 04:52:16,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 236 transitions, 3093 flow [2020-10-16 04:52:19,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 236 transitions, 2944 flow, removed 22 selfloop flow, removed 6 redundant places. [2020-10-16 04:52:19,735 INFO L241 Difference]: Finished difference. Result has 133 places, 198 transitions, 2414 flow [2020-10-16 04:52:19,735 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=2912, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2414, PETRI_PLACES=133, PETRI_TRANSITIONS=198} [2020-10-16 04:52:19,736 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places. [2020-10-16 04:52:19,736 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 198 transitions, 2414 flow [2020-10-16 04:52:19,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:52:19,736 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:19,736 INFO L255 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] [2020-10-16 04:52:19,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 04:52:19,736 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:19,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1958269551, now seen corresponding path program 5 times [2020-10-16 04:52:19,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:19,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127890459] [2020-10-16 04:52:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:19,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127890459] [2020-10-16 04:52:19,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:19,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 04:52:19,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724075317] [2020-10-16 04:52:19,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 04:52:19,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:19,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 04:52:19,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-16 04:52:19,915 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 205 [2020-10-16 04:52:19,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 198 transitions, 2414 flow. Second operand 11 states. [2020-10-16 04:52:19,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:19,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 205 [2020-10-16 04:52:19,917 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:20,861 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][62], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), 12#L852-1true, Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 297#(<= ~__unbuffered_cnt~0 2), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), Black: 461#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:20,861 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2020-10-16 04:52:20,861 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:52:20,861 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:52:20,862 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:52:21,257 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][62], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), Black: 461#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:21,257 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:52:21,257 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:21,257 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:21,258 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:21,259 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][62], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), Black: 461#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:21,259 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:52:21,259 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:21,259 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:21,259 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:22,743 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][62], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), 8#L752true, Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), 12#L852-1true, Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 297#(<= ~__unbuffered_cnt~0 2), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), Black: 461#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:22,743 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2020-10-16 04:52:22,743 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2020-10-16 04:52:22,744 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2020-10-16 04:52:22,744 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2020-10-16 04:52:22,895 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1147] L752-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1)) (= |v_P0Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][203], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), Black: 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), 52#P0EXITtrue, Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), 455#(= ~b~0 1), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 461#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 355#(<= ~__unbuffered_cnt~0 3), 369#true, 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:22,896 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2020-10-16 04:52:22,896 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2020-10-16 04:52:22,896 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2020-10-16 04:52:22,896 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2020-10-16 04:52:22,918 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][62], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), 8#L752true, Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), Black: 461#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:22,918 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2020-10-16 04:52:22,918 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:22,918 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:22,918 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:22,923 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][62], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), 8#L752true, Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), Black: 461#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:22,923 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2020-10-16 04:52:22,923 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:22,924 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:22,924 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2020-10-16 04:52:22,993 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L828-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_5| 0) (= |v_P3Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][209], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 56#L745true, 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), 455#(= ~b~0 1), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 461#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 106#P3EXITtrue, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 355#(<= ~__unbuffered_cnt~0 3), 369#true, 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:22,993 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2020-10-16 04:52:22,993 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2020-10-16 04:52:22,993 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2020-10-16 04:52:22,993 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2020-10-16 04:52:23,045 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L828-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_5| 0) (= |v_P3Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][209], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), 8#L752true, Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 404#(and (<= ~x$w_buff0_used~0 0) (<= 2 ~__unbuffered_cnt~0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 405#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 415#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), Black: 436#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 437#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (= ~__unbuffered_p3_EBX~0 1) (<= 3 ~__unbuffered_cnt~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~__unbuffered_cnt~0 3)), 455#(= ~b~0 1), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 461#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 106#P3EXITtrue, 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 355#(<= ~__unbuffered_cnt~0 3), 369#true, 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:23,046 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2020-10-16 04:52:23,046 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2020-10-16 04:52:23,046 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2020-10-16 04:52:23,046 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2020-10-16 04:52:23,091 INFO L129 PetriNetUnfolder]: 9439/19332 cut-off events. [2020-10-16 04:52:23,092 INFO L130 PetriNetUnfolder]: For 195522/205169 co-relation queries the response was YES. [2020-10-16 04:52:23,288 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126626 conditions, 19332 events. 9439/19332 cut-off events. For 195522/205169 co-relation queries the response was YES. Maximal size of possible extension queue 2433. Compared 211853 event pairs, 1273 based on Foata normal form. 2627/20950 useless extension candidates. Maximal degree in co-relation 126573. Up to 6837 conditions per place. [2020-10-16 04:52:23,350 INFO L132 encePairwiseOnDemand]: 196/205 looper letters, 46 selfloop transitions, 134 changer transitions 7/263 dead transitions. [2020-10-16 04:52:23,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 263 transitions, 3534 flow [2020-10-16 04:52:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:52:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:52:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1588 transitions. [2020-10-16 04:52:23,353 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7746341463414634 [2020-10-16 04:52:23,353 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1588 transitions. [2020-10-16 04:52:23,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1588 transitions. [2020-10-16 04:52:23,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:23,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1588 transitions. [2020-10-16 04:52:23,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:52:23,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:52:23,358 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:52:23,358 INFO L185 Difference]: Start difference. First operand has 133 places, 198 transitions, 2414 flow. Second operand 10 states and 1588 transitions. [2020-10-16 04:52:23,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 263 transitions, 3534 flow [2020-10-16 04:52:29,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 263 transitions, 3432 flow, removed 49 selfloop flow, removed 7 redundant places. [2020-10-16 04:52:29,984 INFO L241 Difference]: Finished difference. Result has 133 places, 249 transitions, 3424 flow [2020-10-16 04:52:29,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3424, PETRI_PLACES=133, PETRI_TRANSITIONS=249} [2020-10-16 04:52:29,984 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places. [2020-10-16 04:52:29,984 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 249 transitions, 3424 flow [2020-10-16 04:52:29,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 04:52:29,984 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:29,984 INFO L255 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] [2020-10-16 04:52:29,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 04:52:29,985 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2146176303, now seen corresponding path program 6 times [2020-10-16 04:52:29,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:29,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123948876] [2020-10-16 04:52:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:30,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123948876] [2020-10-16 04:52:30,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:30,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:52:30,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019608507] [2020-10-16 04:52:30,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:52:30,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:30,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:52:30,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:52:30,077 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 205 [2020-10-16 04:52:30,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 249 transitions, 3424 flow. Second operand 6 states. [2020-10-16 04:52:30,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:30,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 205 [2020-10-16 04:52:30,078 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:31,545 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), 12#L852-1true, Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 297#(<= ~__unbuffered_cnt~0 2), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 480#(and (<= ~__unbuffered_cnt~0 4) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1)), Black: 469#(and (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 470#(and (= ~y~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 472#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (= ~__unbuffered_p1_EAX~0 1)), Black: 473#(and (<= 3 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 474#(and (<= ~__unbuffered_cnt~0 4) (<= 4 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1)), 492#(and (= ~z~0 1) (<= ~x$w_buff1~0 0)), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:31,545 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2020-10-16 04:52:31,545 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:52:31,545 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:52:31,546 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2020-10-16 04:52:31,909 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), Black: 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 480#(and (<= ~__unbuffered_cnt~0 4) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1)), Black: 469#(and (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 470#(and (= ~y~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 472#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (= ~__unbuffered_p1_EAX~0 1)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 473#(and (<= 3 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 474#(and (<= ~__unbuffered_cnt~0 4) (<= 4 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1)), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 492#(and (= ~z~0 1) (<= ~x$w_buff1~0 0)), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:31,909 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:52:31,909 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:31,909 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:31,909 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:32,054 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 480#(and (<= ~__unbuffered_cnt~0 4) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1)), Black: 469#(and (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 470#(and (= ~y~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 472#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (= ~__unbuffered_p1_EAX~0 1)), Black: 473#(and (<= 3 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 474#(and (<= ~__unbuffered_cnt~0 4) (<= 4 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1)), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 492#(and (= ~z~0 1) (<= ~x$w_buff1~0 0)), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:32,054 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:52:32,054 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:32,054 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:32,054 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:32,054 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][67], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 428#true, 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), 466#true, Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 480#(and (<= ~__unbuffered_cnt~0 4) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (<= 4 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1)), Black: 469#(and (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 470#(and (= ~y~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 472#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (= ~__unbuffered_p1_EAX~0 1)), Black: 473#(and (<= 3 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 474#(and (<= ~__unbuffered_cnt~0 4) (<= 4 ~__unbuffered_cnt~0) (= ~__unbuffered_p1_EAX~0 1)), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 492#(and (= ~z~0 1) (<= ~x$w_buff1~0 0)), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:32,055 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:52:32,055 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:32,055 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:32,055 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:33,427 INFO L129 PetriNetUnfolder]: 10284/21703 cut-off events. [2020-10-16 04:52:33,427 INFO L130 PetriNetUnfolder]: For 287244/295386 co-relation queries the response was YES. [2020-10-16 04:52:33,644 INFO L80 FinitePrefix]: Finished finitePrefix Result has 155605 conditions, 21703 events. 10284/21703 cut-off events. For 287244/295386 co-relation queries the response was YES. Maximal size of possible extension queue 2880. Compared 251352 event pairs, 471 based on Foata normal form. 3412/24299 useless extension candidates. Maximal degree in co-relation 155552. Up to 6042 conditions per place. [2020-10-16 04:52:33,674 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 53 selfloop transitions, 19 changer transitions 114/305 dead transitions. [2020-10-16 04:52:33,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 305 transitions, 4354 flow [2020-10-16 04:52:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1135 transitions. [2020-10-16 04:52:33,676 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7909407665505227 [2020-10-16 04:52:33,676 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1135 transitions. [2020-10-16 04:52:33,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1135 transitions. [2020-10-16 04:52:33,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:33,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1135 transitions. [2020-10-16 04:52:33,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:33,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:33,678 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:33,678 INFO L185 Difference]: Start difference. First operand has 133 places, 249 transitions, 3424 flow. Second operand 7 states and 1135 transitions. [2020-10-16 04:52:33,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 305 transitions, 4354 flow [2020-10-16 04:52:44,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 305 transitions, 4141 flow, removed 55 selfloop flow, removed 4 redundant places. [2020-10-16 04:52:44,287 INFO L241 Difference]: Finished difference. Result has 135 places, 176 transitions, 2218 flow [2020-10-16 04:52:44,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2218, PETRI_PLACES=135, PETRI_TRANSITIONS=176} [2020-10-16 04:52:44,288 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places. [2020-10-16 04:52:44,288 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 176 transitions, 2218 flow [2020-10-16 04:52:44,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:52:44,288 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:44,288 INFO L255 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] [2020-10-16 04:52:44,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 04:52:44,288 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash 801393331, now seen corresponding path program 7 times [2020-10-16 04:52:44,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:44,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551631541] [2020-10-16 04:52:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:44,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551631541] [2020-10-16 04:52:44,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:44,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:52:44,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430392421] [2020-10-16 04:52:44,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:52:44,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:44,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:52:44,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:52:44,749 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 205 [2020-10-16 04:52:44,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 176 transitions, 2218 flow. Second operand 10 states. [2020-10-16 04:52:44,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:44,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 205 [2020-10-16 04:52:44,750 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:46,285 INFO L129 PetriNetUnfolder]: 4530/10237 cut-off events. [2020-10-16 04:52:46,285 INFO L130 PetriNetUnfolder]: For 122949/127936 co-relation queries the response was YES. [2020-10-16 04:52:46,371 INFO L80 FinitePrefix]: Finished finitePrefix Result has 71344 conditions, 10237 events. 4530/10237 cut-off events. For 122949/127936 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 112397 event pairs, 399 based on Foata normal form. 1843/11641 useless extension candidates. Maximal degree in co-relation 71291. Up to 2601 conditions per place. [2020-10-16 04:52:46,389 INFO L132 encePairwiseOnDemand]: 196/205 looper letters, 50 selfloop transitions, 50 changer transitions 31/231 dead transitions. [2020-10-16 04:52:46,390 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 231 transitions, 3026 flow [2020-10-16 04:52:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:52:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:52:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1245 transitions. [2020-10-16 04:52:46,391 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7591463414634146 [2020-10-16 04:52:46,391 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1245 transitions. [2020-10-16 04:52:46,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1245 transitions. [2020-10-16 04:52:46,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:46,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1245 transitions. [2020-10-16 04:52:46,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:52:46,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:52:46,394 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:52:46,394 INFO L185 Difference]: Start difference. First operand has 135 places, 176 transitions, 2218 flow. Second operand 8 states and 1245 transitions. [2020-10-16 04:52:46,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 231 transitions, 3026 flow [2020-10-16 04:52:48,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 231 transitions, 2927 flow, removed 32 selfloop flow, removed 6 redundant places. [2020-10-16 04:52:48,760 INFO L241 Difference]: Finished difference. Result has 135 places, 181 transitions, 2310 flow [2020-10-16 04:52:48,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2310, PETRI_PLACES=135, PETRI_TRANSITIONS=181} [2020-10-16 04:52:48,760 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places. [2020-10-16 04:52:48,760 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 181 transitions, 2310 flow [2020-10-16 04:52:48,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:52:48,760 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:48,760 INFO L255 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] [2020-10-16 04:52:48,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 04:52:48,761 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:48,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:48,761 INFO L82 PathProgramCache]: Analyzing trace with hash -906502803, now seen corresponding path program 8 times [2020-10-16 04:52:48,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:48,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364508445] [2020-10-16 04:52:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:48,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364508445] [2020-10-16 04:52:48,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:48,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:52:48,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132409683] [2020-10-16 04:52:48,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:52:48,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:48,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:52:48,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:52:48,865 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 205 [2020-10-16 04:52:48,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 181 transitions, 2310 flow. Second operand 7 states. [2020-10-16 04:52:48,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:48,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 205 [2020-10-16 04:52:48,866 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:49,760 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1080] L818-->L821: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][93], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), Black: 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), 6#P1EXITtrue, Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 514#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 ~__unbuffered_p1_EAX~0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff0_used~0 ~y~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 516#(and (not (= ~__unbuffered_p1_EAX~0 0)) (= ~y~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), Black: 518#(and (not (= ~__unbuffered_p1_EAX~0 0)) (= ~y~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 394#true, Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 507#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff0_used~0 ~y~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 524#true, Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 44#P2EXITtrue, Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), 59#L821true, Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 455#(= ~b~0 1), Black: 336#(<= ~x$w_buff0~0 0), Black: 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 469#(and (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 470#(and (= ~y~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 362#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 491#(<= ~x$w_buff1~0 0), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), Black: 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 369#true, 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, 506#(and (= ~y~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:49,761 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2020-10-16 04:52:49,761 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:49,761 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:49,761 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2020-10-16 04:52:50,193 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1146] L782-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1)) (= |v_P1Thread1of1ForFork1_#res.base_5| 0) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][199], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), 516#(and (not (= ~__unbuffered_p1_EAX~0 0)) (= ~y~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 514#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 ~__unbuffered_p1_EAX~0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff0_used~0 ~y~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 518#(and (not (= ~__unbuffered_p1_EAX~0 0)) (= ~y~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 507#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff0_used~0 ~y~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 532#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), 455#(= ~b~0 1), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 469#(and (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 470#(and (= ~y~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 106#P3EXITtrue, 491#(<= ~x$w_buff1~0 0), 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), 109#L742true, Black: 355#(<= ~__unbuffered_cnt~0 3), 369#true, 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:50,194 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2020-10-16 04:52:50,194 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2020-10-16 04:52:50,194 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2020-10-16 04:52:50,194 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2020-10-16 04:52:50,225 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1146] L782-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1)) (= |v_P1Thread1of1ForFork1_#res.base_5| 0) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][199], [Black: 371#(and (<= ~x$w_buff0~0 0) (= ~__unbuffered_cnt~0 0)), 516#(and (not (= ~__unbuffered_p1_EAX~0 0)) (= ~y~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 373#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_cnt~0 0)), Black: 375#(and (<= 1 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 1)), 6#P1EXITtrue, Black: 376#(and (<= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 2) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 377#(and (<= 3 ~__unbuffered_cnt~0) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~__unbuffered_cnt~0 3)), Black: 514#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 ~__unbuffered_p1_EAX~0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff0_used~0 ~y~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 382#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~__unbuffered_cnt~0 0)), 394#true, Black: 518#(and (not (= ~__unbuffered_p1_EAX~0 0)) (= ~y~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 134#(and (= ~z~0 0) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 507#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff0_used~0 ~y~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 254#(and (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), 532#(and (= ~y~0 1) (<= ~x$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 272#(= ~__unbuffered_cnt~0 0), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 275#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 144#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 145#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 284#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 283#(<= ~__unbuffered_cnt~0 1), Black: 286#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 411#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 396#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (= ~__unbuffered_cnt~0 0)), Black: 413#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p3_EBX~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), Black: 398#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (<= 0 ~x$r_buff0_thd3~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256)))), 298#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 44#P2EXITtrue, Black: 304#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 297#(<= ~__unbuffered_cnt~0 2), Black: 173#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 56#L745true, 312#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256)))), Black: 186#(and (= ~x~0 1) (<= ~x$w_buff0~0 0) (<= ~x$w_buff1~0 0)), Black: 434#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 435#(and (<= 2 ~__unbuffered_cnt~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 2) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 1 ~x$r_buff0_thd2~0)), 455#(= ~b~0 1), Black: 313#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~b~0 1) (= ~x$w_buff0_used~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$r_buff0_thd4~0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 1 ~x$r_buff0_thd2~0)), Black: 459#(and (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), 338#(and (= ~b~0 1) (<= ~x$w_buff1~0 0)), Black: 336#(<= ~x$w_buff0~0 0), Black: 469#(and (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 470#(and (= ~y~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), Black: 224#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 106#P3EXITtrue, 491#(<= ~x$w_buff1~0 0), 364#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (<= ~__unbuffered_cnt~0 3)), Black: 355#(<= ~__unbuffered_cnt~0 3), 369#true, 117#L2true, Black: 244#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$w_buff1~0 0)), P2Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, 253#(and (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (<= ~x$w_buff1~0 0)), P0Thread1of1ForFork0InUse]) [2020-10-16 04:52:50,225 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2020-10-16 04:52:50,225 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2020-10-16 04:52:50,225 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2020-10-16 04:52:50,225 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2020-10-16 04:52:50,357 INFO L129 PetriNetUnfolder]: 4176/9561 cut-off events. [2020-10-16 04:52:50,357 INFO L130 PetriNetUnfolder]: For 132868/137847 co-relation queries the response was YES. [2020-10-16 04:52:50,431 INFO L80 FinitePrefix]: Finished finitePrefix Result has 67830 conditions, 9561 events. 4176/9561 cut-off events. For 132868/137847 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 104158 event pairs, 389 based on Foata normal form. 2335/11506 useless extension candidates. Maximal degree in co-relation 67781. Up to 2832 conditions per place. [2020-10-16 04:52:50,443 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 19 selfloop transitions, 2 changer transitions 124/212 dead transitions. [2020-10-16 04:52:50,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 212 transitions, 2937 flow [2020-10-16 04:52:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:52:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:52:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1106 transitions. [2020-10-16 04:52:50,445 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7707317073170732 [2020-10-16 04:52:50,445 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1106 transitions. [2020-10-16 04:52:50,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1106 transitions. [2020-10-16 04:52:50,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:50,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1106 transitions. [2020-10-16 04:52:50,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:52:50,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:52:50,447 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:52:50,447 INFO L185 Difference]: Start difference. First operand has 135 places, 181 transitions, 2310 flow. Second operand 7 states and 1106 transitions. [2020-10-16 04:52:50,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 212 transitions, 2937 flow [2020-10-16 04:52:51,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 212 transitions, 2890 flow, removed 21 selfloop flow, removed 4 redundant places. [2020-10-16 04:52:51,874 INFO L241 Difference]: Finished difference. Result has 138 places, 88 transitions, 925 flow [2020-10-16 04:52:51,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=2265, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=925, PETRI_PLACES=138, PETRI_TRANSITIONS=88} [2020-10-16 04:52:51,875 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 94 predicate places. [2020-10-16 04:52:51,875 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 88 transitions, 925 flow [2020-10-16 04:52:51,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:52:51,875 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:51,875 INFO L255 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] [2020-10-16 04:52:51,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 04:52:51,876 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash 81374489, now seen corresponding path program 9 times [2020-10-16 04:52:51,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:51,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727881927] [2020-10-16 04:52:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:52:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:52:52,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727881927] [2020-10-16 04:52:52,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:52:52,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:52:52,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898755512] [2020-10-16 04:52:52,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:52:52,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:52:52,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:52:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:52:52,154 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 205 [2020-10-16 04:52:52,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 88 transitions, 925 flow. Second operand 9 states. [2020-10-16 04:52:52,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:52:52,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 205 [2020-10-16 04:52:52,155 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:52:52,677 INFO L129 PetriNetUnfolder]: 1491/3222 cut-off events. [2020-10-16 04:52:52,677 INFO L130 PetriNetUnfolder]: For 32691/33995 co-relation queries the response was YES. [2020-10-16 04:52:52,702 INFO L80 FinitePrefix]: Finished finitePrefix Result has 21434 conditions, 3222 events. 1491/3222 cut-off events. For 32691/33995 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 28171 event pairs, 157 based on Foata normal form. 323/3401 useless extension candidates. Maximal degree in co-relation 21384. Up to 960 conditions per place. [2020-10-16 04:52:52,708 INFO L132 encePairwiseOnDemand]: 197/205 looper letters, 27 selfloop transitions, 14 changer transitions 15/123 dead transitions. [2020-10-16 04:52:52,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 1504 flow [2020-10-16 04:52:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:52:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:52:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1206 transitions. [2020-10-16 04:52:52,710 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7353658536585366 [2020-10-16 04:52:52,710 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1206 transitions. [2020-10-16 04:52:52,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1206 transitions. [2020-10-16 04:52:52,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:52:52,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1206 transitions. [2020-10-16 04:52:52,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:52:52,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:52:52,714 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:52:52,714 INFO L185 Difference]: Start difference. First operand has 138 places, 88 transitions, 925 flow. Second operand 8 states and 1206 transitions. [2020-10-16 04:52:52,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 1504 flow [2020-10-16 04:52:53,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 123 transitions, 1146 flow, removed 140 selfloop flow, removed 30 redundant places. [2020-10-16 04:52:53,079 INFO L241 Difference]: Finished difference. Result has 99 places, 97 transitions, 873 flow [2020-10-16 04:52:53,079 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=873, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2020-10-16 04:52:53,079 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2020-10-16 04:52:53,080 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 873 flow [2020-10-16 04:52:53,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:52:53,080 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:52:53,080 INFO L255 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] [2020-10-16 04:52:53,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 04:52:53,080 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:52:53,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:52:53,080 INFO L82 PathProgramCache]: Analyzing trace with hash 426296313, now seen corresponding path program 10 times [2020-10-16 04:52:53,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:52:53,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351828306] [2020-10-16 04:52:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:52:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:52:53,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:52:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:52:53,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:52:53,292 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:52:53,292 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:52:53,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 04:52:53,338 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,338 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,345 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,345 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,346 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,350 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,350 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,352 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,352 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,352 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:52:53,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:52:53,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:52:53 BasicIcfg [2020-10-16 04:52:53,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:52:53,462 INFO L168 Benchmark]: Toolchain (without parser) took 83512.01 ms. Allocated memory was 249.0 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 204.0 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,462 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 249.0 MB. Free memory was 227.1 MB in the beginning and 226.3 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.79 ms. Allocated memory was 249.0 MB in the beginning and 307.8 MB in the end (delta: 58.7 MB). Free memory was 204.0 MB in the beginning and 254.9 MB in the end (delta: -50.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.26 ms. Allocated memory is still 307.8 MB. Free memory was 254.9 MB in the beginning and 252.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,467 INFO L168 Benchmark]: Boogie Preprocessor took 39.81 ms. Allocated memory is still 307.8 MB. Free memory was 252.4 MB in the beginning and 249.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,467 INFO L168 Benchmark]: RCFGBuilder took 2271.87 ms. Allocated memory was 307.8 MB in the beginning and 368.1 MB in the end (delta: 60.3 MB). Free memory was 249.1 MB in the beginning and 335.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 146.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,468 INFO L168 Benchmark]: TraceAbstraction took 80417.26 ms. Allocated memory was 368.1 MB in the beginning and 3.4 GB in the end (delta: 3.0 GB). Free memory was 335.2 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 14.2 GB. [2020-10-16 04:52:53,475 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 249.0 MB. Free memory was 227.1 MB in the beginning and 226.3 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 712.79 ms. Allocated memory was 249.0 MB in the beginning and 307.8 MB in the end (delta: 58.7 MB). Free memory was 204.0 MB in the beginning and 254.9 MB in the end (delta: -50.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.26 ms. Allocated memory is still 307.8 MB. Free memory was 254.9 MB in the beginning and 252.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.81 ms. Allocated memory is still 307.8 MB. Free memory was 252.4 MB in the beginning and 249.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2271.87 ms. Allocated memory was 307.8 MB in the beginning and 368.1 MB in the end (delta: 60.3 MB). Free memory was 249.1 MB in the beginning and 335.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 146.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 80417.26 ms. Allocated memory was 368.1 MB in the beginning and 3.4 GB in the end (delta: 3.0 GB). Free memory was 335.2 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1892 VarBasedMoverChecksPositive, 103 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 323 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.4s, 121 PlacesBefore, 44 PlacesAfterwards, 110 TransitionsBefore, 32 TransitionsAfterwards, 2806 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 7943 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L714] 0 _Bool x$flush_delayed; [L715] 0 int x$mem_tmp; [L716] 0 _Bool x$r_buff0_thd0; [L717] 0 _Bool x$r_buff0_thd1; [L718] 0 _Bool x$r_buff0_thd2; [L719] 0 _Bool x$r_buff0_thd3; [L720] 0 _Bool x$r_buff0_thd4; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$r_buff1_thd3; [L725] 0 _Bool x$r_buff1_thd4; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L845] 0 pthread_t t1185; [L846] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t1186; [L848] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L771] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] 0 pthread_t t1187; [L850] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t1188; [L852] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 4 z = 2 [L814] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L817] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L820] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L777] 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) [L777] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L777] 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) [L777] 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) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 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 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L781] 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 [L797] 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) [L797] 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) [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 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 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L801] 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 [L823] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L823] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L824] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L824] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L825] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L826] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L827] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 3 return 0; [L830] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 4 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L858] 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) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] 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) [L858] 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) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L860] 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 [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L862] 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 [L865] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L866] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L867] 0 x$flush_delayed = weak$$choice2 [L868] 0 x$mem_tmp = x [L869] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L869] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L870] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L870] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L871] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L871] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L872] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L872] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L874] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L875] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L877] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L877] 0 x = x$flush_delayed ? x$mem_tmp : x [L878] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 113 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 80.1s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 67.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 183 SDtfs, 324 SDslu, 384 SDs, 0 SdLazy, 3690 SolverSat, 368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3424occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 525 ConstructedInterpolants, 0 QuantifiedInterpolants, 163809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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! Received shutdown request...