/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix007_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:15:02,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:15:02,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:15:02,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:15:02,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:15:02,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:15:02,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:15:02,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:15:02,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:15:02,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:15:02,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:15:02,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:15:02,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:15:02,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:15:02,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:15:02,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:15:02,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:15:02,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:15:02,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:15:02,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:15:02,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:15:02,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:15:02,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:15:02,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:15:02,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:15:02,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:15:02,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:15:02,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:15:02,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:15:02,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:15:02,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:15:02,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:15:02,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:15:02,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:15:02,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:15:02,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:15:02,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:15:02,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:15:02,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:15:02,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:15:02,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:15:02,463 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-RepeatedSemanticLbe.epf [2021-03-25 14:15:02,477 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:15:02,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:15:02,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:15:02,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:15:02,478 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:15:02,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:15:02,479 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:15:02,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:15:02,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:15:02,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:15:02,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:15:02,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:15:02,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:15:02,479 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:15:02,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:15:02,480 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:15:02,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:15:02,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:15:02,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:15:02,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:15:02,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:15:02,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:15:02,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:15:02,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:15:02,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:15:02,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:15:02,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:15:02,481 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:15:02,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:15:02,481 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:15:02,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:15:02,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:15:02,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:15:02,699 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:15:02,700 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:15:02,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_rmo.oepc.i [2021-03-25 14:15:02,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0340e55fb/18db7f4db6944adc9a15911ba43543ef/FLAG4900d6ceb [2021-03-25 14:15:03,235 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:15:03,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_rmo.oepc.i [2021-03-25 14:15:03,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0340e55fb/18db7f4db6944adc9a15911ba43543ef/FLAG4900d6ceb [2021-03-25 14:15:03,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0340e55fb/18db7f4db6944adc9a15911ba43543ef [2021-03-25 14:15:03,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:15:03,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:15:03,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:15:03,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:15:03,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:15:03,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25aef6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03, skipping insertion in model container [2021-03-25 14:15:03,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:15:03,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:15:03,691 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_rmo.oepc.i[949,962] [2021-03-25 14:15:03,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:15:03,846 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:15:03,853 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_rmo.oepc.i[949,962] [2021-03-25 14:15:03,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:15:03,927 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:15:03,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03 WrapperNode [2021-03-25 14:15:03,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:15:03,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:15:03,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:15:03,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:15:03,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:15:03,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:15:03,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:15:03,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:15:03,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (1/1) ... [2021-03-25 14:15:03,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:15:03,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:15:03,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:15:03,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:15:03,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (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 [2021-03-25 14:15:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:15:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:15:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:15:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:15:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:15:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:15:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:15:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:15:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:15:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:15:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:15:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:15:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:15:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:15:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:15:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:15:04,054 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:15:05,975 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:15:05,976 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:15:05,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:15:05 BoogieIcfgContainer [2021-03-25 14:15:05,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:15:05,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:15:05,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:15:05,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:15:05,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:15:03" (1/3) ... [2021-03-25 14:15:05,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105608a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:15:05, skipping insertion in model container [2021-03-25 14:15:05,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:15:03" (2/3) ... [2021-03-25 14:15:05,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105608a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:15:05, skipping insertion in model container [2021-03-25 14:15:05,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:15:05" (3/3) ... [2021-03-25 14:15:05,982 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_rmo.oepc.i [2021-03-25 14:15:05,986 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:15:05,989 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:15:05,989 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:15:06,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,023 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,023 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,027 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,032 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,040 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,047 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,054 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,055 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,057 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,057 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:15:06,058 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:15:06,070 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:15:06,083 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:15:06,083 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:15:06,083 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:15:06,083 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:15:06,083 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:15:06,083 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:15:06,083 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:15:06,083 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:15:06,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 14:15:06,123 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 14:15:06,124 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:15:06,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 14:15:06,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 14:15:06,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-25 14:15:06,138 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:15:06,146 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 14:15:06,151 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 14:15:06,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-25 14:15:06,180 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 14:15:06,180 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:15:06,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 14:15:06,184 INFO L142 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-25 14:15:07,880 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:15:08,360 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:15:08,522 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:15:10,061 INFO L154 LiptonReduction]: Checked pairs total: 5647 [2021-03-25 14:15:10,061 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-25 14:15:10,062 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3924 [2021-03-25 14:15:10,068 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-25 14:15:10,068 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:15:10,068 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:15:10,068 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:15:10,068 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:15:10,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:15:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1588435965, now seen corresponding path program 1 times [2021-03-25 14:15:10,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:15:10,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563683016] [2021-03-25 14:15:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:15:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:15:10,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:10,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:15:10,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:10,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:15:10,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563683016] [2021-03-25 14:15:10,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:15:10,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:15:10,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116207529] [2021-03-25 14:15:10,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:15:10,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:15:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:15:10,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:15:10,276 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-25 14:15:10,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:10,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:15:10,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-25 14:15:10,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:15:10,410 INFO L129 PetriNetUnfolder]: 133/349 cut-off events. [2021-03-25 14:15:10,410 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:15:10,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 349 events. 133/349 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1875 event pairs, 110 based on Foata normal form. 33/362 useless extension candidates. Maximal degree in co-relation 546. Up to 153 conditions per place. [2021-03-25 14:15:10,416 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 11 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-25 14:15:10,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 142 flow [2021-03-25 14:15:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:15:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:15:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-25 14:15:10,431 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-03-25 14:15:10,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-25 14:15:10,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-25 14:15:10,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:15:10,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-25 14:15:10,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:10,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:10,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:10,451 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 3 states and 535 transitions. [2021-03-25 14:15:10,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 142 flow [2021-03-25 14:15:10,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:15:10,454 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 106 flow [2021-03-25 14:15:10,458 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2021-03-25 14:15:10,458 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-25 14:15:10,458 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:15:10,458 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 14:15:10,459 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 14:15:10,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow [2021-03-25 14:15:10,464 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-25 14:15:10,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:15:10,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:15:10,466 INFO L142 LiptonReduction]: Number of co-enabled transitions 702 [2021-03-25 14:15:11,828 INFO L154 LiptonReduction]: Checked pairs total: 3042 [2021-03-25 14:15:11,829 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:15:11,829 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1371 [2021-03-25 14:15:11,830 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 82 flow [2021-03-25 14:15:11,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:11,830 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:15:11,830 INFO L263 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] [2021-03-25 14:15:11,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:15:11,830 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:15:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:15:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1813580090, now seen corresponding path program 1 times [2021-03-25 14:15:11,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:15:11,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971764527] [2021-03-25 14:15:11,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:15:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:15:11,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:11,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:15:11,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:11,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:11,898 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:15:11,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:15:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:15:11,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971764527] [2021-03-25 14:15:11,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:15:11,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:15:11,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316391247] [2021-03-25 14:15:11,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:15:11,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:15:11,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:15:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:15:11,909 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 207 [2021-03-25 14:15:11,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:11,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:15:11,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 207 [2021-03-25 14:15:11,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:15:11,940 INFO L129 PetriNetUnfolder]: 1/37 cut-off events. [2021-03-25 14:15:11,940 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:15:11,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2021-03-25 14:15:11,941 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 1 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2021-03-25 14:15:11,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 98 flow [2021-03-25 14:15:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:15:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:15:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2021-03-25 14:15:11,943 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8859903381642512 [2021-03-25 14:15:11,943 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 917 transitions. [2021-03-25 14:15:11,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 917 transitions. [2021-03-25 14:15:11,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:15:11,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 917 transitions. [2021-03-25 14:15:11,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:11,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:11,947 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:11,947 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 82 flow. Second operand 5 states and 917 transitions. [2021-03-25 14:15:11,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 98 flow [2021-03-25 14:15:11,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:15:11,948 INFO L241 Difference]: Finished difference. Result has 49 places, 33 transitions, 82 flow [2021-03-25 14:15:11,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2021-03-25 14:15:11,949 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -13 predicate places. [2021-03-25 14:15:11,949 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:15:11,949 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 33 transitions, 82 flow [2021-03-25 14:15:11,950 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 33 transitions, 82 flow [2021-03-25 14:15:11,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 82 flow [2021-03-25 14:15:11,952 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-03-25 14:15:11,952 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:15:11,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:15:11,953 INFO L142 LiptonReduction]: Number of co-enabled transitions 446 [2021-03-25 14:15:12,188 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 14:15:12,402 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 14:15:12,556 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 14:15:12,797 INFO L154 LiptonReduction]: Checked pairs total: 1710 [2021-03-25 14:15:12,798 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:15:12,798 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 849 [2021-03-25 14:15:12,812 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 76 flow [2021-03-25 14:15:12,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:12,812 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:15:12,812 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:15:12,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:15:12,812 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:15:12,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:15:12,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1935713152, now seen corresponding path program 1 times [2021-03-25 14:15:12,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:15:12,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793465146] [2021-03-25 14:15:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:15:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:15:12,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:12,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:12,883 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 14:15:12,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:15:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:15:12,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793465146] [2021-03-25 14:15:12,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:15:12,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:15:12,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024028908] [2021-03-25 14:15:12,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:15:12,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:15:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:15:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:15:12,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 210 [2021-03-25 14:15:12,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:12,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:15:12,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 210 [2021-03-25 14:15:12,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:15:12,962 INFO L129 PetriNetUnfolder]: 117/318 cut-off events. [2021-03-25 14:15:12,962 INFO L130 PetriNetUnfolder]: For 46/78 co-relation queries the response was YES. [2021-03-25 14:15:12,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 318 events. 117/318 cut-off events. For 46/78 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1642 event pairs, 21 based on Foata normal form. 14/323 useless extension candidates. Maximal degree in co-relation 573. Up to 153 conditions per place. [2021-03-25 14:15:12,964 INFO L132 encePairwiseOnDemand]: 201/210 looper letters, 12 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2021-03-25 14:15:12,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 142 flow [2021-03-25 14:15:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:15:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:15:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2021-03-25 14:15:12,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2021-03-25 14:15:12,966 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2021-03-25 14:15:12,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2021-03-25 14:15:12,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:15:12,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2021-03-25 14:15:12,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:12,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:12,969 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:12,969 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 76 flow. Second operand 4 states and 686 transitions. [2021-03-25 14:15:12,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 142 flow [2021-03-25 14:15:12,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:15:12,970 INFO L241 Difference]: Finished difference. Result has 46 places, 36 transitions, 133 flow [2021-03-25 14:15:12,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2021-03-25 14:15:12,971 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -16 predicate places. [2021-03-25 14:15:12,971 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:15:12,971 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 133 flow [2021-03-25 14:15:12,972 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 133 flow [2021-03-25 14:15:12,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 133 flow [2021-03-25 14:15:13,000 INFO L129 PetriNetUnfolder]: 99/298 cut-off events. [2021-03-25 14:15:13,000 INFO L130 PetriNetUnfolder]: For 86/94 co-relation queries the response was YES. [2021-03-25 14:15:13,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 298 events. 99/298 cut-off events. For 86/94 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1735 event pairs, 54 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 591. Up to 146 conditions per place. [2021-03-25 14:15:13,003 INFO L142 LiptonReduction]: Number of co-enabled transitions 518 [2021-03-25 14:15:13,570 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:15:13,840 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:15:14,390 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:15:14,614 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:15:14,625 INFO L154 LiptonReduction]: Checked pairs total: 774 [2021-03-25 14:15:14,625 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:15:14,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1654 [2021-03-25 14:15:14,625 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 131 flow [2021-03-25 14:15:14,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:14,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:15:14,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:15:14,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:15:14,626 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:15:14,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:15:14,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2009499891, now seen corresponding path program 1 times [2021-03-25 14:15:14,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:15:14,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945610140] [2021-03-25 14:15:14,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:15:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:15:14,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:14,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:14,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:14,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:14,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:14,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:15:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:15:14,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945610140] [2021-03-25 14:15:14,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:15:14,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:15:14,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713231307] [2021-03-25 14:15:14,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:15:14,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:15:14,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:15:14,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:15:14,695 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-25 14:15:14,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:14,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:15:14,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-25 14:15:14,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:15:14,824 INFO L129 PetriNetUnfolder]: 615/1212 cut-off events. [2021-03-25 14:15:14,824 INFO L130 PetriNetUnfolder]: For 266/325 co-relation queries the response was YES. [2021-03-25 14:15:14,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2593 conditions, 1212 events. 615/1212 cut-off events. For 266/325 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 8879 event pairs, 302 based on Foata normal form. 96/1150 useless extension candidates. Maximal degree in co-relation 2580. Up to 706 conditions per place. [2021-03-25 14:15:14,832 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 10 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2021-03-25 14:15:14,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 197 flow [2021-03-25 14:15:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:15:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:15:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-03-25 14:15:14,835 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8502369668246446 [2021-03-25 14:15:14,835 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-03-25 14:15:14,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-03-25 14:15:14,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:15:14,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-03-25 14:15:14,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:14,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:14,839 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:14,839 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 131 flow. Second operand 5 states and 897 transitions. [2021-03-25 14:15:14,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 197 flow [2021-03-25 14:15:14,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:15:14,842 INFO L241 Difference]: Finished difference. Result has 51 places, 44 transitions, 204 flow [2021-03-25 14:15:14,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2021-03-25 14:15:14,843 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2021-03-25 14:15:14,843 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:15:14,843 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 44 transitions, 204 flow [2021-03-25 14:15:14,843 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 204 flow [2021-03-25 14:15:14,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 204 flow [2021-03-25 14:15:14,928 INFO L129 PetriNetUnfolder]: 675/1332 cut-off events. [2021-03-25 14:15:14,928 INFO L130 PetriNetUnfolder]: For 982/1323 co-relation queries the response was YES. [2021-03-25 14:15:14,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 1332 events. 675/1332 cut-off events. For 982/1323 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 10025 event pairs, 316 based on Foata normal form. 4/1158 useless extension candidates. Maximal degree in co-relation 3701. Up to 831 conditions per place. [2021-03-25 14:15:14,963 INFO L142 LiptonReduction]: Number of co-enabled transitions 786 [2021-03-25 14:15:15,178 INFO L154 LiptonReduction]: Checked pairs total: 893 [2021-03-25 14:15:15,179 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:15:15,179 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 336 [2021-03-25 14:15:15,179 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 198 flow [2021-03-25 14:15:15,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:15,180 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:15:15,180 INFO L263 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] [2021-03-25 14:15:15,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:15:15,180 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:15:15,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:15:15,180 INFO L82 PathProgramCache]: Analyzing trace with hash 476951076, now seen corresponding path program 1 times [2021-03-25 14:15:15,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:15:15,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669531757] [2021-03-25 14:15:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:15:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:15:15,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:15,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:15:15,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:15,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:15,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:15,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:15:15,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669531757] [2021-03-25 14:15:15,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:15:15,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:15:15,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018907486] [2021-03-25 14:15:15,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:15:15,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:15:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:15:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:15:15,225 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 211 [2021-03-25 14:15:15,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 182.25) internal successors, (729), 4 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:15,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:15:15,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 211 [2021-03-25 14:15:15,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:15:15,347 INFO L129 PetriNetUnfolder]: 763/1503 cut-off events. [2021-03-25 14:15:15,348 INFO L130 PetriNetUnfolder]: For 1581/2320 co-relation queries the response was YES. [2021-03-25 14:15:15,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4233 conditions, 1503 events. 763/1503 cut-off events. For 1581/2320 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 11261 event pairs, 398 based on Foata normal form. 48/1343 useless extension candidates. Maximal degree in co-relation 4216. Up to 953 conditions per place. [2021-03-25 14:15:15,359 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 5 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2021-03-25 14:15:15,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 199 flow [2021-03-25 14:15:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:15:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:15:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 732 transitions. [2021-03-25 14:15:15,361 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8672985781990521 [2021-03-25 14:15:15,361 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 732 transitions. [2021-03-25 14:15:15,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 732 transitions. [2021-03-25 14:15:15,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:15:15,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 732 transitions. [2021-03-25 14:15:15,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:15,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:15,364 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:15,364 INFO L185 Difference]: Start difference. First operand has 51 places, 43 transitions, 198 flow. Second operand 4 states and 732 transitions. [2021-03-25 14:15:15,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 199 flow [2021-03-25 14:15:15,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 192 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:15:15,373 INFO L241 Difference]: Finished difference. Result has 52 places, 40 transitions, 186 flow [2021-03-25 14:15:15,373 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2021-03-25 14:15:15,374 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2021-03-25 14:15:15,374 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:15:15,374 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 40 transitions, 186 flow [2021-03-25 14:15:15,374 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 186 flow [2021-03-25 14:15:15,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 186 flow [2021-03-25 14:15:15,485 INFO L129 PetriNetUnfolder]: 831/1616 cut-off events. [2021-03-25 14:15:15,485 INFO L130 PetriNetUnfolder]: For 1337/1555 co-relation queries the response was YES. [2021-03-25 14:15:15,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4387 conditions, 1616 events. 831/1616 cut-off events. For 1337/1555 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 12371 event pairs, 412 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 4371. Up to 1038 conditions per place. [2021-03-25 14:15:15,501 INFO L142 LiptonReduction]: Number of co-enabled transitions 648 [2021-03-25 14:15:15,975 INFO L154 LiptonReduction]: Checked pairs total: 290 [2021-03-25 14:15:15,976 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:15:15,976 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 602 [2021-03-25 14:15:15,976 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 186 flow [2021-03-25 14:15:15,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 182.25) internal successors, (729), 4 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:15,977 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:15:15,977 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:15:15,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:15:15,977 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:15:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:15:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1993643359, now seen corresponding path program 1 times [2021-03-25 14:15:15,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:15:15,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389793262] [2021-03-25 14:15:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:15:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:15:16,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:16,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:16,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:16,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:15:16,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:16,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:15:16,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:16,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:15:16,081 INFO L142 QuantifierPusher]: treesize reduction 14, result has 70.2 percent of original size [2021-03-25 14:15:16,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 14:15:16,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:16,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:15:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:15:16,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389793262] [2021-03-25 14:15:16,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:15:16,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:15:16,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633901241] [2021-03-25 14:15:16,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:15:16,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:15:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:15:16,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:15:16,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2021-03-25 14:15:16,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 186 flow. Second operand has 7 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:16,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:15:16,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2021-03-25 14:15:16,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:15:17,887 INFO L129 PetriNetUnfolder]: 9486/15419 cut-off events. [2021-03-25 14:15:17,887 INFO L130 PetriNetUnfolder]: For 13268/14544 co-relation queries the response was YES. [2021-03-25 14:15:17,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44317 conditions, 15419 events. 9486/15419 cut-off events. For 13268/14544 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 121035 event pairs, 2040 based on Foata normal form. 125/14558 useless extension candidates. Maximal degree in co-relation 44299. Up to 5258 conditions per place. [2021-03-25 14:15:18,001 INFO L132 encePairwiseOnDemand]: 196/211 looper letters, 44 selfloop transitions, 63 changer transitions 0/124 dead transitions. [2021-03-25 14:15:18,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 124 transitions, 778 flow [2021-03-25 14:15:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:15:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:15:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1252 transitions. [2021-03-25 14:15:18,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7417061611374408 [2021-03-25 14:15:18,004 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1252 transitions. [2021-03-25 14:15:18,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1252 transitions. [2021-03-25 14:15:18,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:15:18,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1252 transitions. [2021-03-25 14:15:18,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.5) internal successors, (1252), 8 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:18,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:18,008 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:18,008 INFO L185 Difference]: Start difference. First operand has 52 places, 40 transitions, 186 flow. Second operand 8 states and 1252 transitions. [2021-03-25 14:15:18,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 124 transitions, 778 flow [2021-03-25 14:15:18,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 124 transitions, 777 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:15:18,021 INFO L241 Difference]: Finished difference. Result has 64 places, 102 transitions, 784 flow [2021-03-25 14:15:18,021 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=784, PETRI_PLACES=64, PETRI_TRANSITIONS=102} [2021-03-25 14:15:18,022 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2021-03-25 14:15:18,022 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:15:18,022 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 102 transitions, 784 flow [2021-03-25 14:15:18,022 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 102 transitions, 784 flow [2021-03-25 14:15:18,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 102 transitions, 784 flow [2021-03-25 14:15:19,034 INFO L129 PetriNetUnfolder]: 6118/10836 cut-off events. [2021-03-25 14:15:19,034 INFO L130 PetriNetUnfolder]: For 17363/18938 co-relation queries the response was YES. [2021-03-25 14:15:19,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35585 conditions, 10836 events. 6118/10836 cut-off events. For 17363/18938 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 93176 event pairs, 1425 based on Foata normal form. 43/9930 useless extension candidates. Maximal degree in co-relation 35562. Up to 4496 conditions per place. [2021-03-25 14:15:19,153 INFO L142 LiptonReduction]: Number of co-enabled transitions 1534 [2021-03-25 14:15:54,298 INFO L154 LiptonReduction]: Checked pairs total: 249 [2021-03-25 14:15:54,298 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:15:54,298 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36276 [2021-03-25 14:15:54,299 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 102 transitions, 784 flow [2021-03-25 14:15:54,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:54,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:15:54,299 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:15:54,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:15:54,299 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:15:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:15:54,300 INFO L82 PathProgramCache]: Analyzing trace with hash -959765525, now seen corresponding path program 1 times [2021-03-25 14:15:54,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:15:54,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871945752] [2021-03-25 14:15:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:15:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:15:54,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:54,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:15:54,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:54,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:54,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:54,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:54,394 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 14:15:54,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:15:54,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:54,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:15:54,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:15:54,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:15:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:15:54,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871945752] [2021-03-25 14:15:54,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:15:54,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:15:54,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766736800] [2021-03-25 14:15:54,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:15:54,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:15:54,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:15:54,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:15:54,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 211 [2021-03-25 14:15:54,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 102 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:54,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:15:54,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 211 [2021-03-25 14:15:54,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:15:56,304 INFO L129 PetriNetUnfolder]: 10341/16244 cut-off events. [2021-03-25 14:15:56,304 INFO L130 PetriNetUnfolder]: For 32947/35947 co-relation queries the response was YES. [2021-03-25 14:15:56,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60393 conditions, 16244 events. 10341/16244 cut-off events. For 32947/35947 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 120233 event pairs, 512 based on Foata normal form. 2493/18229 useless extension candidates. Maximal degree in co-relation 60368. Up to 5833 conditions per place. [2021-03-25 14:15:56,374 INFO L132 encePairwiseOnDemand]: 203/211 looper letters, 160 selfloop transitions, 19 changer transitions 3/239 dead transitions. [2021-03-25 14:15:56,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 239 transitions, 1970 flow [2021-03-25 14:15:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:15:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:15:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1134 transitions. [2021-03-25 14:15:56,376 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7677725118483413 [2021-03-25 14:15:56,376 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1134 transitions. [2021-03-25 14:15:56,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1134 transitions. [2021-03-25 14:15:56,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:15:56,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1134 transitions. [2021-03-25 14:15:56,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:56,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:56,380 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:15:56,380 INFO L185 Difference]: Start difference. First operand has 64 places, 102 transitions, 784 flow. Second operand 7 states and 1134 transitions. [2021-03-25 14:15:56,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 239 transitions, 1970 flow [2021-03-25 14:15:56,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 239 transitions, 1969 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:15:56,413 INFO L241 Difference]: Finished difference. Result has 73 places, 116 transitions, 970 flow [2021-03-25 14:15:56,413 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=970, PETRI_PLACES=73, PETRI_TRANSITIONS=116} [2021-03-25 14:15:56,413 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2021-03-25 14:15:56,413 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:15:56,413 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 116 transitions, 970 flow [2021-03-25 14:15:56,413 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 116 transitions, 970 flow [2021-03-25 14:15:56,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 116 transitions, 970 flow [2021-03-25 14:15:57,071 INFO L129 PetriNetUnfolder]: 3933/7964 cut-off events. [2021-03-25 14:15:57,071 INFO L130 PetriNetUnfolder]: For 22581/26333 co-relation queries the response was YES. [2021-03-25 14:15:57,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33695 conditions, 7964 events. 3933/7964 cut-off events. For 22581/26333 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 74266 event pairs, 460 based on Foata normal form. 442/7973 useless extension candidates. Maximal degree in co-relation 33667. Up to 3940 conditions per place. [2021-03-25 14:15:57,157 INFO L142 LiptonReduction]: Number of co-enabled transitions 2330 [2021-03-25 14:16:04,646 INFO L154 LiptonReduction]: Checked pairs total: 279 [2021-03-25 14:16:04,647 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:16:04,647 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8234 [2021-03-25 14:16:04,647 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 116 transitions, 970 flow [2021-03-25 14:16:04,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:04,648 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:16:04,648 INFO L263 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] [2021-03-25 14:16:04,648 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:16:04,648 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:16:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:16:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1292125578, now seen corresponding path program 1 times [2021-03-25 14:16:04,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:16:04,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950765043] [2021-03-25 14:16:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:16:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:16:04,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:04,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:16:04,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:04,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:16:04,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:04,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:16:04,696 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 14:16:04,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:16:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:16:04,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950765043] [2021-03-25 14:16:04,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:16:04,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:16:04,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958296883] [2021-03-25 14:16:04,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:16:04,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:16:04,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:16:04,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:16:04,712 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 211 [2021-03-25 14:16:04,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 116 transitions, 970 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:04,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:16:04,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 211 [2021-03-25 14:16:04,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:16:05,716 INFO L129 PetriNetUnfolder]: 4941/10324 cut-off events. [2021-03-25 14:16:05,716 INFO L130 PetriNetUnfolder]: For 34602/44649 co-relation queries the response was YES. [2021-03-25 14:16:05,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45624 conditions, 10324 events. 4941/10324 cut-off events. For 34602/44649 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 102788 event pairs, 554 based on Foata normal form. 759/10635 useless extension candidates. Maximal degree in co-relation 45594. Up to 5388 conditions per place. [2021-03-25 14:16:05,846 INFO L132 encePairwiseOnDemand]: 201/211 looper letters, 42 selfloop transitions, 49 changer transitions 25/174 dead transitions. [2021-03-25 14:16:05,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 174 transitions, 1779 flow [2021-03-25 14:16:05,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:16:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:16:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1013 transitions. [2021-03-25 14:16:05,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8001579778830964 [2021-03-25 14:16:05,849 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1013 transitions. [2021-03-25 14:16:05,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1013 transitions. [2021-03-25 14:16:05,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:16:05,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1013 transitions. [2021-03-25 14:16:05,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:05,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:05,852 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:05,852 INFO L185 Difference]: Start difference. First operand has 73 places, 116 transitions, 970 flow. Second operand 6 states and 1013 transitions. [2021-03-25 14:16:05,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 174 transitions, 1779 flow [2021-03-25 14:16:06,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 174 transitions, 1732 flow, removed 17 selfloop flow, removed 2 redundant places. [2021-03-25 14:16:06,613 INFO L241 Difference]: Finished difference. Result has 79 places, 132 transitions, 1263 flow [2021-03-25 14:16:06,613 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1263, PETRI_PLACES=79, PETRI_TRANSITIONS=132} [2021-03-25 14:16:06,613 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2021-03-25 14:16:06,613 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:16:06,613 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 132 transitions, 1263 flow [2021-03-25 14:16:06,613 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 132 transitions, 1263 flow [2021-03-25 14:16:06,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 132 transitions, 1263 flow [2021-03-25 14:16:07,414 INFO L129 PetriNetUnfolder]: 4982/10297 cut-off events. [2021-03-25 14:16:07,414 INFO L130 PetriNetUnfolder]: For 33161/36876 co-relation queries the response was YES. [2021-03-25 14:16:07,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40407 conditions, 10297 events. 4982/10297 cut-off events. For 33161/36876 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 101928 event pairs, 674 based on Foata normal form. 658/10409 useless extension candidates. Maximal degree in co-relation 40376. Up to 3938 conditions per place. [2021-03-25 14:16:07,515 INFO L142 LiptonReduction]: Number of co-enabled transitions 2536 [2021-03-25 14:16:31,324 INFO L154 LiptonReduction]: Checked pairs total: 1126 [2021-03-25 14:16:31,325 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:16:31,325 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24712 [2021-03-25 14:16:31,325 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 132 transitions, 1267 flow [2021-03-25 14:16:31,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:31,325 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:16:31,326 INFO L263 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] [2021-03-25 14:16:31,326 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:16:31,326 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:16:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:16:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1923671134, now seen corresponding path program 1 times [2021-03-25 14:16:31,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:16:31,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297630044] [2021-03-25 14:16:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:16:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:16:31,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:31,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:16:31,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:31,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:16:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:16:31,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297630044] [2021-03-25 14:16:31,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:16:31,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:16:31,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946718648] [2021-03-25 14:16:31,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:16:31,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:16:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:16:31,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:16:31,352 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 213 [2021-03-25 14:16:31,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 132 transitions, 1267 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:31,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:16:31,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 213 [2021-03-25 14:16:31,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:16:32,454 INFO L129 PetriNetUnfolder]: 6138/12984 cut-off events. [2021-03-25 14:16:32,455 INFO L130 PetriNetUnfolder]: For 43044/47925 co-relation queries the response was YES. [2021-03-25 14:16:32,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50613 conditions, 12984 events. 6138/12984 cut-off events. For 43044/47925 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 136482 event pairs, 865 based on Foata normal form. 972/13359 useless extension candidates. Maximal degree in co-relation 50580. Up to 5225 conditions per place. [2021-03-25 14:16:32,526 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 16 selfloop transitions, 22 changer transitions 9/141 dead transitions. [2021-03-25 14:16:32,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 141 transitions, 1456 flow [2021-03-25 14:16:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:16:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:16:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2021-03-25 14:16:32,528 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8810641627543035 [2021-03-25 14:16:32,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 563 transitions. [2021-03-25 14:16:32,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions. [2021-03-25 14:16:32,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:16:32,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions. [2021-03-25 14:16:32,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:32,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:32,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:32,530 INFO L185 Difference]: Start difference. First operand has 79 places, 132 transitions, 1267 flow. Second operand 3 states and 563 transitions. [2021-03-25 14:16:32,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 141 transitions, 1456 flow [2021-03-25 14:16:33,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 141 transitions, 1426 flow, removed 15 selfloop flow, removed 1 redundant places. [2021-03-25 14:16:33,445 INFO L241 Difference]: Finished difference. Result has 81 places, 131 transitions, 1293 flow [2021-03-25 14:16:33,445 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=81, PETRI_TRANSITIONS=131} [2021-03-25 14:16:33,445 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 19 predicate places. [2021-03-25 14:16:33,445 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:16:33,445 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 131 transitions, 1293 flow [2021-03-25 14:16:33,445 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 131 transitions, 1293 flow [2021-03-25 14:16:33,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 131 transitions, 1293 flow [2021-03-25 14:16:34,236 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][8], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 79#P3EXITtrue, Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), 85#L889true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 207#(= ~x~0 1), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 218#true, Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 50#L768true, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:34,237 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 14:16:34,237 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:34,237 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:34,237 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:34,430 INFO L129 PetriNetUnfolder]: 5998/12579 cut-off events. [2021-03-25 14:16:34,431 INFO L130 PetriNetUnfolder]: For 37945/41886 co-relation queries the response was YES. [2021-03-25 14:16:34,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46204 conditions, 12579 events. 5998/12579 cut-off events. For 37945/41886 co-relation queries the response was YES. Maximal size of possible extension queue 1367. Compared 131248 event pairs, 915 based on Foata normal form. 744/12597 useless extension candidates. Maximal degree in co-relation 46172. Up to 5143 conditions per place. [2021-03-25 14:16:34,562 INFO L142 LiptonReduction]: Number of co-enabled transitions 2520 [2021-03-25 14:16:52,463 INFO L154 LiptonReduction]: Checked pairs total: 380 [2021-03-25 14:16:52,598 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:16:52,598 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19153 [2021-03-25 14:16:52,598 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 131 transitions, 1293 flow [2021-03-25 14:16:52,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:52,599 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:16:52,599 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:16:52,599 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:16:52,599 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:16:52,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:16:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash -123898980, now seen corresponding path program 1 times [2021-03-25 14:16:52,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:16:52,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402567243] [2021-03-25 14:16:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:16:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:16:52,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:52,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:16:52,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:52,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:16:52,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:52,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:16:52,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:52,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:16:52,704 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 14:16:52,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:16:52,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:52,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:16:52,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:16:52,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:16:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:16:52,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402567243] [2021-03-25 14:16:52,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:16:52,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:16:52,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593716958] [2021-03-25 14:16:52,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:16:52,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:16:52,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:16:52,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:16:52,720 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 213 [2021-03-25 14:16:52,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 131 transitions, 1293 flow. Second operand has 7 states, 7 states have (on average 153.14285714285714) internal successors, (1072), 7 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:52,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:16:52,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 213 [2021-03-25 14:16:52,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:16:53,760 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][154], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), 25#L847true, Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 231#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 40#L765true, 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:53,760 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 14:16:53,760 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:16:53,760 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:16:53,760 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:16:54,098 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][116], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 218#true, Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 231#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 56#P0ENTRYtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:54,099 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 14:16:54,099 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:16:54,099 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:16:54,099 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:16:54,100 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][154], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 231#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 40#L765true, 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:54,100 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,101 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,101 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,101 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,411 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][116], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 231#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 40#L765true, 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:54,412 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,412 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,412 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,412 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,535 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 79#P3EXITtrue, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 218#true, Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 56#P0ENTRYtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:54,535 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,535 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,535 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,535 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:16:54,537 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][210], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 207#(= ~x~0 1), 79#P3EXITtrue, Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 40#L765true, 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:54,537 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,537 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,537 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,537 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,649 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][140], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 79#P3EXITtrue, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 87#L878-1true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 218#true, Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 220#(= ~y~0 1), 95#L788true, 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 228#(not (= 4 ~__unbuffered_cnt~0)), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:54,649 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,649 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,649 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,649 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,651 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][116], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 95#L788true, 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 231#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:54,651 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,651 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,651 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,651 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,769 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][116], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 218#true, Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 231#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 50#L768true, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:54,769 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,769 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,769 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,769 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,776 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 207#(= ~x~0 1), 79#P3EXITtrue, Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 40#L765true, 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:54,776 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,776 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,776 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:54,776 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 14:16:55,061 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 79#P3EXITtrue, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 218#true, Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 220#(= ~y~0 1), 31#L818true, 95#L788true, Black: 157#(= ~__unbuffered_cnt~0 0), 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,061 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,062 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,062 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,062 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,062 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][116], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, 29#L795true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 231#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,062 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,062 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,063 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,063 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,063 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 79#P3EXITtrue, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, 95#L788true, Black: 157#(= ~__unbuffered_cnt~0 0), 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,063 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,063 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,063 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,063 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,083 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][116], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 231#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 114#L775true, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,083 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,083 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,083 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,083 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,148 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 79#P3EXITtrue, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 218#true, Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 50#L768true, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,149 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,149 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,149 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,149 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 14:16:55,325 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,325 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,325 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,325 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,325 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,326 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,326 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,326 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,326 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,326 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,332 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 77#L854true, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,332 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,332 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,332 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,332 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,332 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,332 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 207#(= ~x~0 1), 79#P3EXITtrue, Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, 29#L795true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,332 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,332 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,333 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,333 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,345 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][187], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 79#P3EXITtrue, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 233#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 114#L775true, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,346 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,346 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,346 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,346 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 14:16:55,508 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][242], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 207#(= ~x~0 1), 79#P3EXITtrue, Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 229#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,508 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,508 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,508 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,508 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,509 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][242], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 79#P3EXITtrue, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 147#true, 83#L3true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 229#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,509 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,509 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,509 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,509 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,511 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_154, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][242], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 197#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), Black: 199#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 79#P3EXITtrue, 207#(= ~x~0 1), Black: 141#(= ~__unbuffered_p2_EAX~0 0), 83#L3true, 147#true, Black: 211#(and (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 213#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#true, Black: 220#(= ~y~0 1), 31#L818true, Black: 157#(= ~__unbuffered_cnt~0 0), 229#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 170#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), Black: 167#(= ~z~0 1), 176#(= ~a$r_buff0_thd2~0 0), 58#P0EXITtrue, Black: 177#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 178#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 179#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 126#P1EXITtrue, Black: 182#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 184#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:16:55,511 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,512 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,512 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,512 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,512 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:16:55,746 INFO L129 PetriNetUnfolder]: 16312/26168 cut-off events. [2021-03-25 14:16:55,747 INFO L130 PetriNetUnfolder]: For 64340/68965 co-relation queries the response was YES. [2021-03-25 14:16:55,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101827 conditions, 26168 events. 16312/26168 cut-off events. For 64340/68965 co-relation queries the response was YES. Maximal size of possible extension queue 1925. Compared 216701 event pairs, 477 based on Foata normal form. 2202/27442 useless extension candidates. Maximal degree in co-relation 101793. Up to 7173 conditions per place. [2021-03-25 14:16:55,840 INFO L132 encePairwiseOnDemand]: 205/213 looper letters, 97 selfloop transitions, 28 changer transitions 116/286 dead transitions. [2021-03-25 14:16:55,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 286 transitions, 2725 flow [2021-03-25 14:16:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:16:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:16:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1452 transitions. [2021-03-25 14:16:55,846 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7574334898278561 [2021-03-25 14:16:55,846 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1452 transitions. [2021-03-25 14:16:55,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1452 transitions. [2021-03-25 14:16:55,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:16:55,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1452 transitions. [2021-03-25 14:16:55,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.33333333333334) internal successors, (1452), 9 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:55,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:55,851 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:16:55,851 INFO L185 Difference]: Start difference. First operand has 81 places, 131 transitions, 1293 flow. Second operand 9 states and 1452 transitions. [2021-03-25 14:16:55,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 286 transitions, 2725 flow [2021-03-25 14:16:57,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 286 transitions, 2703 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:16:57,505 INFO L241 Difference]: Finished difference. Result has 91 places, 104 transitions, 980 flow [2021-03-25 14:16:57,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=980, PETRI_PLACES=91, PETRI_TRANSITIONS=104} [2021-03-25 14:16:57,505 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 29 predicate places. [2021-03-25 14:16:57,505 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:16:57,505 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 104 transitions, 980 flow [2021-03-25 14:16:57,505 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 104 transitions, 980 flow [2021-03-25 14:16:57,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 104 transitions, 980 flow [2021-03-25 14:16:58,189 INFO L129 PetriNetUnfolder]: 3442/8604 cut-off events. [2021-03-25 14:16:58,189 INFO L130 PetriNetUnfolder]: For 30534/33348 co-relation queries the response was YES. [2021-03-25 14:16:58,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37758 conditions, 8604 events. 3442/8604 cut-off events. For 30534/33348 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 97795 event pairs, 337 based on Foata normal form. 243/8450 useless extension candidates. Maximal degree in co-relation 37722. Up to 4219 conditions per place. [2021-03-25 14:16:58,357 INFO L142 LiptonReduction]: Number of co-enabled transitions 1962 [2021-03-25 14:17:41,172 INFO L154 LiptonReduction]: Checked pairs total: 1222 [2021-03-25 14:17:41,172 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:17:41,172 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43667 [2021-03-25 14:17:41,172 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 104 transitions, 993 flow [2021-03-25 14:17:41,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 153.14285714285714) internal successors, (1072), 7 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:41,173 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:17:41,173 INFO L263 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] [2021-03-25 14:17:41,173 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:17:41,173 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:17:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:17:41,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1850316255, now seen corresponding path program 1 times [2021-03-25 14:17:41,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:17:41,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652365716] [2021-03-25 14:17:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:17:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:17:41,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:17:41,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:17:41,270 INFO L142 QuantifierPusher]: treesize reduction 14, result has 81.1 percent of original size [2021-03-25 14:17:41,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-25 14:17:41,297 INFO L142 QuantifierPusher]: treesize reduction 22, result has 68.6 percent of original size [2021-03-25 14:17:41,299 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.3 percent of original size 39 [2021-03-25 14:17:41,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:17:41,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:17:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:17:41,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652365716] [2021-03-25 14:17:41,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:17:41,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:17:41,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23649384] [2021-03-25 14:17:41,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:17:41,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:17:41,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:17:41,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:17:41,327 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 216 [2021-03-25 14:17:41,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 104 transitions, 993 flow. Second operand has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:41,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:17:41,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 216 [2021-03-25 14:17:41,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:17:43,447 INFO L129 PetriNetUnfolder]: 8736/21039 cut-off events. [2021-03-25 14:17:43,447 INFO L130 PetriNetUnfolder]: For 86454/96741 co-relation queries the response was YES. [2021-03-25 14:17:43,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94459 conditions, 21039 events. 8736/21039 cut-off events. For 86454/96741 co-relation queries the response was YES. Maximal size of possible extension queue 2778. Compared 264368 event pairs, 555 based on Foata normal form. 1143/21298 useless extension candidates. Maximal degree in co-relation 94421. Up to 10997 conditions per place. [2021-03-25 14:17:43,555 INFO L132 encePairwiseOnDemand]: 207/216 looper letters, 39 selfloop transitions, 31 changer transitions 11/151 dead transitions. [2021-03-25 14:17:43,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 151 transitions, 1479 flow [2021-03-25 14:17:43,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:17:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:17:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1205 transitions. [2021-03-25 14:17:43,557 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.796957671957672 [2021-03-25 14:17:43,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1205 transitions. [2021-03-25 14:17:43,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1205 transitions. [2021-03-25 14:17:43,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:17:43,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1205 transitions. [2021-03-25 14:17:43,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 172.14285714285714) internal successors, (1205), 7 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:43,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:43,562 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:43,562 INFO L185 Difference]: Start difference. First operand has 91 places, 104 transitions, 993 flow. Second operand 7 states and 1205 transitions. [2021-03-25 14:17:43,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 151 transitions, 1479 flow [2021-03-25 14:17:52,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 151 transitions, 1367 flow, removed 31 selfloop flow, removed 5 redundant places. [2021-03-25 14:17:52,303 INFO L241 Difference]: Finished difference. Result has 96 places, 127 transitions, 1161 flow [2021-03-25 14:17:52,303 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1161, PETRI_PLACES=96, PETRI_TRANSITIONS=127} [2021-03-25 14:17:52,303 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 34 predicate places. [2021-03-25 14:17:52,304 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:17:52,304 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 127 transitions, 1161 flow [2021-03-25 14:17:52,304 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 127 transitions, 1161 flow [2021-03-25 14:17:52,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 127 transitions, 1161 flow [2021-03-25 14:17:54,003 INFO L129 PetriNetUnfolder]: 9467/21881 cut-off events. [2021-03-25 14:17:54,004 INFO L130 PetriNetUnfolder]: For 63500/66983 co-relation queries the response was YES. [2021-03-25 14:17:54,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81390 conditions, 21881 events. 9467/21881 cut-off events. For 63500/66983 co-relation queries the response was YES. Maximal size of possible extension queue 2707. Compared 268642 event pairs, 493 based on Foata normal form. 747/21651 useless extension candidates. Maximal degree in co-relation 81350. Up to 5667 conditions per place. [2021-03-25 14:17:54,268 INFO L142 LiptonReduction]: Number of co-enabled transitions 2536 [2021-03-25 14:17:56,016 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:17:56,017 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:17:56,017 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3714 [2021-03-25 14:17:56,017 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 127 transitions, 1161 flow [2021-03-25 14:17:56,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:56,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:17:56,018 INFO L263 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] [2021-03-25 14:17:56,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:17:56,018 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:17:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:17:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash 98037247, now seen corresponding path program 1 times [2021-03-25 14:17:56,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:17:56,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447171328] [2021-03-25 14:17:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:17:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:17:56,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:17:56,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:17:56,070 INFO L142 QuantifierPusher]: treesize reduction 4, result has 90.0 percent of original size [2021-03-25 14:17:56,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:17:56,104 INFO L142 QuantifierPusher]: treesize reduction 17, result has 76.7 percent of original size [2021-03-25 14:17:56,106 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.9 percent of original size 47 [2021-03-25 14:17:56,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:17:56,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:17:56,163 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 14:17:56,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:17:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:17:56,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447171328] [2021-03-25 14:17:56,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:17:56,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:17:56,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330434456] [2021-03-25 14:17:56,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:17:56,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:17:56,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:17:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:17:56,173 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 216 [2021-03-25 14:17:56,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 127 transitions, 1161 flow. Second operand has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:56,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:17:56,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 216 [2021-03-25 14:17:56,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:17:58,470 INFO L129 PetriNetUnfolder]: 10131/23944 cut-off events. [2021-03-25 14:17:58,470 INFO L130 PetriNetUnfolder]: For 84069/90039 co-relation queries the response was YES. [2021-03-25 14:17:58,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93006 conditions, 23944 events. 10131/23944 cut-off events. For 84069/90039 co-relation queries the response was YES. Maximal size of possible extension queue 3158. Compared 301607 event pairs, 482 based on Foata normal form. 1497/24213 useless extension candidates. Maximal degree in co-relation 92964. Up to 6407 conditions per place. [2021-03-25 14:17:58,621 INFO L132 encePairwiseOnDemand]: 207/216 looper letters, 46 selfloop transitions, 33 changer transitions 10/159 dead transitions. [2021-03-25 14:17:58,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 159 transitions, 1681 flow [2021-03-25 14:17:58,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:17:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:17:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1148 transitions. [2021-03-25 14:17:58,633 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2021-03-25 14:17:58,633 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1148 transitions. [2021-03-25 14:17:58,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1148 transitions. [2021-03-25 14:17:58,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:17:58,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1148 transitions. [2021-03-25 14:17:58,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.0) internal successors, (1148), 7 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:58,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:58,637 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:17:58,637 INFO L185 Difference]: Start difference. First operand has 96 places, 127 transitions, 1161 flow. Second operand 7 states and 1148 transitions. [2021-03-25 14:17:58,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 159 transitions, 1681 flow [2021-03-25 14:18:06,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 159 transitions, 1660 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:18:06,778 INFO L241 Difference]: Finished difference. Result has 104 places, 135 transitions, 1346 flow [2021-03-25 14:18:06,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1346, PETRI_PLACES=104, PETRI_TRANSITIONS=135} [2021-03-25 14:18:06,779 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 42 predicate places. [2021-03-25 14:18:06,779 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:18:06,779 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 135 transitions, 1346 flow [2021-03-25 14:18:06,779 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 135 transitions, 1346 flow [2021-03-25 14:18:06,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 135 transitions, 1346 flow [2021-03-25 14:18:08,677 INFO L129 PetriNetUnfolder]: 10122/23824 cut-off events. [2021-03-25 14:18:08,677 INFO L130 PetriNetUnfolder]: For 89915/94059 co-relation queries the response was YES. [2021-03-25 14:18:08,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91513 conditions, 23824 events. 10122/23824 cut-off events. For 89915/94059 co-relation queries the response was YES. Maximal size of possible extension queue 3125. Compared 302535 event pairs, 538 based on Foata normal form. 771/23396 useless extension candidates. Maximal degree in co-relation 91469. Up to 6476 conditions per place. [2021-03-25 14:18:09,138 INFO L142 LiptonReduction]: Number of co-enabled transitions 2764 [2021-03-25 14:18:15,157 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:18:15,157 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:18:15,158 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8379 [2021-03-25 14:18:15,158 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 135 transitions, 1346 flow [2021-03-25 14:18:15,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:15,158 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:18:15,159 INFO L263 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] [2021-03-25 14:18:15,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:18:15,159 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:18:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:18:15,160 INFO L82 PathProgramCache]: Analyzing trace with hash -686301022, now seen corresponding path program 1 times [2021-03-25 14:18:15,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:18:15,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156140246] [2021-03-25 14:18:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:18:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:18:15,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:18:15,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:18:15,215 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-03-25 14:18:15,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 14:18:15,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:18:15,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:18:15,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:18:15,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:18:15,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:18:15,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:18:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:18:15,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156140246] [2021-03-25 14:18:15,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:18:15,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:18:15,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170453895] [2021-03-25 14:18:15,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:18:15,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:18:15,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:18:15,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:18:15,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 216 [2021-03-25 14:18:15,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 135 transitions, 1346 flow. Second operand has 7 states, 7 states have (on average 161.14285714285714) internal successors, (1128), 7 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:15,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:18:15,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 216 [2021-03-25 14:18:15,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:18:18,414 INFO L129 PetriNetUnfolder]: 12907/29621 cut-off events. [2021-03-25 14:18:18,414 INFO L130 PetriNetUnfolder]: For 141067/148894 co-relation queries the response was YES. [2021-03-25 14:18:18,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118599 conditions, 29621 events. 12907/29621 cut-off events. For 141067/148894 co-relation queries the response was YES. Maximal size of possible extension queue 4065. Compared 375717 event pairs, 567 based on Foata normal form. 1830/29832 useless extension candidates. Maximal degree in co-relation 118553. Up to 8067 conditions per place. [2021-03-25 14:18:18,572 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 65 selfloop transitions, 26 changer transitions 16/177 dead transitions. [2021-03-25 14:18:18,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 177 transitions, 2050 flow [2021-03-25 14:18:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:18:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:18:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1150 transitions. [2021-03-25 14:18:18,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7605820105820106 [2021-03-25 14:18:18,575 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1150 transitions. [2021-03-25 14:18:18,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1150 transitions. [2021-03-25 14:18:18,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:18:18,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1150 transitions. [2021-03-25 14:18:18,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.28571428571428) internal successors, (1150), 7 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:18,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:18,578 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:18,578 INFO L185 Difference]: Start difference. First operand has 104 places, 135 transitions, 1346 flow. Second operand 7 states and 1150 transitions. [2021-03-25 14:18:18,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 177 transitions, 2050 flow [2021-03-25 14:18:31,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 2004 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:18:31,147 INFO L241 Difference]: Finished difference. Result has 111 places, 145 transitions, 1506 flow [2021-03-25 14:18:31,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1506, PETRI_PLACES=111, PETRI_TRANSITIONS=145} [2021-03-25 14:18:31,147 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 49 predicate places. [2021-03-25 14:18:31,148 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:18:31,148 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 145 transitions, 1506 flow [2021-03-25 14:18:31,148 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 145 transitions, 1506 flow [2021-03-25 14:18:31,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 145 transitions, 1506 flow [2021-03-25 14:18:33,615 INFO L129 PetriNetUnfolder]: 12785/29389 cut-off events. [2021-03-25 14:18:33,615 INFO L130 PetriNetUnfolder]: For 124847/130285 co-relation queries the response was YES. [2021-03-25 14:18:33,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114410 conditions, 29389 events. 12785/29389 cut-off events. For 124847/130285 co-relation queries the response was YES. Maximal size of possible extension queue 3946. Compared 377802 event pairs, 619 based on Foata normal form. 958/28777 useless extension candidates. Maximal degree in co-relation 114362. Up to 7897 conditions per place. [2021-03-25 14:18:34,076 INFO L142 LiptonReduction]: Number of co-enabled transitions 3004 [2021-03-25 14:18:42,238 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:18:42,239 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:18:42,239 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11091 [2021-03-25 14:18:42,239 INFO L480 AbstractCegarLoop]: Abstraction has has 111 places, 145 transitions, 1506 flow [2021-03-25 14:18:42,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 161.14285714285714) internal successors, (1128), 7 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:42,240 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:18:42,240 INFO L263 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] [2021-03-25 14:18:42,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:18:42,240 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:18:42,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:18:42,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1327210161, now seen corresponding path program 2 times [2021-03-25 14:18:42,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:18:42,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940688832] [2021-03-25 14:18:42,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:18:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:18:42,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:18:42,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:18:42,298 INFO L142 QuantifierPusher]: treesize reduction 7, result has 82.1 percent of original size [2021-03-25 14:18:42,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:18:42,322 INFO L142 QuantifierPusher]: treesize reduction 11, result has 79.2 percent of original size [2021-03-25 14:18:42,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:18:42,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:18:42,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:18:42,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:18:42,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:18:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:18:42,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940688832] [2021-03-25 14:18:42,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:18:42,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:18:42,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946248396] [2021-03-25 14:18:42,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:18:42,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:18:42,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:18:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:18:42,383 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 216 [2021-03-25 14:18:42,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 145 transitions, 1506 flow. Second operand has 7 states, 7 states have (on average 163.14285714285714) internal successors, (1142), 7 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:42,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:18:42,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 216 [2021-03-25 14:18:42,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:18:46,362 INFO L129 PetriNetUnfolder]: 15368/35143 cut-off events. [2021-03-25 14:18:46,363 INFO L130 PetriNetUnfolder]: For 178765/187850 co-relation queries the response was YES. [2021-03-25 14:18:46,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141028 conditions, 35143 events. 15368/35143 cut-off events. For 178765/187850 co-relation queries the response was YES. Maximal size of possible extension queue 5100. Compared 457638 event pairs, 517 based on Foata normal form. 2105/35214 useless extension candidates. Maximal degree in co-relation 140978. Up to 9684 conditions per place. [2021-03-25 14:18:46,597 INFO L132 encePairwiseOnDemand]: 208/216 looper letters, 56 selfloop transitions, 60 changer transitions 15/201 dead transitions. [2021-03-25 14:18:46,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 201 transitions, 2525 flow [2021-03-25 14:18:46,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:18:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:18:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1338 transitions. [2021-03-25 14:18:46,599 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7743055555555556 [2021-03-25 14:18:46,599 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1338 transitions. [2021-03-25 14:18:46,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1338 transitions. [2021-03-25 14:18:46,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:18:46,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1338 transitions. [2021-03-25 14:18:46,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 167.25) internal successors, (1338), 8 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:46,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:46,603 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:18:46,603 INFO L185 Difference]: Start difference. First operand has 111 places, 145 transitions, 1506 flow. Second operand 8 states and 1338 transitions. [2021-03-25 14:18:46,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 201 transitions, 2525 flow [2021-03-25 14:19:03,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 201 transitions, 2524 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:19:03,135 INFO L241 Difference]: Finished difference. Result has 121 places, 171 transitions, 2075 flow [2021-03-25 14:19:03,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2075, PETRI_PLACES=121, PETRI_TRANSITIONS=171} [2021-03-25 14:19:03,135 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 59 predicate places. [2021-03-25 14:19:03,135 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:03,135 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 171 transitions, 2075 flow [2021-03-25 14:19:03,135 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 171 transitions, 2075 flow [2021-03-25 14:19:03,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 171 transitions, 2075 flow [2021-03-25 14:19:06,851 INFO L129 PetriNetUnfolder]: 15695/35612 cut-off events. [2021-03-25 14:19:06,851 INFO L130 PetriNetUnfolder]: For 183940/190763 co-relation queries the response was YES. [2021-03-25 14:19:07,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143507 conditions, 35612 events. 15695/35612 cut-off events. For 183940/190763 co-relation queries the response was YES. Maximal size of possible extension queue 4994. Compared 466007 event pairs, 664 based on Foata normal form. 1235/34975 useless extension candidates. Maximal degree in co-relation 143454. Up to 9620 conditions per place. [2021-03-25 14:19:07,354 INFO L142 LiptonReduction]: Number of co-enabled transitions 3542 [2021-03-25 14:19:14,712 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 14:19:14,885 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 14:19:41,236 INFO L154 LiptonReduction]: Checked pairs total: 10 [2021-03-25 14:19:41,237 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:19:41,237 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38102 [2021-03-25 14:19:41,237 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 171 transitions, 2099 flow [2021-03-25 14:19:41,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.14285714285714) internal successors, (1142), 7 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:41,237 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:41,237 INFO L263 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] [2021-03-25 14:19:41,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:19:41,238 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash 332548811, now seen corresponding path program 3 times [2021-03-25 14:19:41,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:41,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157854953] [2021-03-25 14:19:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:41,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:41,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:41,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:41,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:41,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:41,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:41,292 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 14:19:41,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:19:41,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:41,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:41,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:41,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:19:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:41,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157854953] [2021-03-25 14:19:41,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:41,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:19:41,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831818157] [2021-03-25 14:19:41,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:19:41,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:19:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:19:41,306 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2021-03-25 14:19:41,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 171 transitions, 2099 flow. Second operand has 7 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:41,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:41,307 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2021-03-25 14:19:41,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:45,835 INFO L129 PetriNetUnfolder]: 13869/32617 cut-off events. [2021-03-25 14:19:45,835 INFO L130 PetriNetUnfolder]: For 271299/330696 co-relation queries the response was YES. [2021-03-25 14:19:46,142 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150153 conditions, 32617 events. 13869/32617 cut-off events. For 271299/330696 co-relation queries the response was YES. Maximal size of possible extension queue 4857. Compared 429681 event pairs, 399 based on Foata normal form. 15763/46486 useless extension candidates. Maximal degree in co-relation 150098. Up to 9168 conditions per place. [2021-03-25 14:19:46,166 INFO L132 encePairwiseOnDemand]: 209/217 looper letters, 2 selfloop transitions, 30 changer transitions 58/169 dead transitions. [2021-03-25 14:19:46,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 169 transitions, 2072 flow [2021-03-25 14:19:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 14:19:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 14:19:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1837 transitions. [2021-03-25 14:19:46,170 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8465437788018433 [2021-03-25 14:19:46,170 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1837 transitions. [2021-03-25 14:19:46,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1837 transitions. [2021-03-25 14:19:46,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:46,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1837 transitions. [2021-03-25 14:19:46,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 183.7) internal successors, (1837), 10 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:46,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:46,174 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:46,174 INFO L185 Difference]: Start difference. First operand has 121 places, 171 transitions, 2099 flow. Second operand 10 states and 1837 transitions. [2021-03-25 14:19:46,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 169 transitions, 2072 flow [2021-03-25 14:19:58,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 169 transitions, 2023 flow, removed 19 selfloop flow, removed 2 redundant places. [2021-03-25 14:19:58,939 INFO L241 Difference]: Finished difference. Result has 131 places, 111 transitions, 1215 flow [2021-03-25 14:19:58,939 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1215, PETRI_PLACES=131, PETRI_TRANSITIONS=111} [2021-03-25 14:19:58,939 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 69 predicate places. [2021-03-25 14:19:58,940 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:58,940 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 111 transitions, 1215 flow [2021-03-25 14:19:58,940 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 111 transitions, 1215 flow [2021-03-25 14:19:58,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 111 transitions, 1215 flow [2021-03-25 14:19:59,751 INFO L129 PetriNetUnfolder]: 3974/9996 cut-off events. [2021-03-25 14:19:59,751 INFO L130 PetriNetUnfolder]: For 43037/45895 co-relation queries the response was YES. [2021-03-25 14:19:59,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46337 conditions, 9996 events. 3974/9996 cut-off events. For 43037/45895 co-relation queries the response was YES. Maximal size of possible extension queue 1469. Compared 118377 event pairs, 176 based on Foata normal form. 156/9529 useless extension candidates. Maximal degree in co-relation 46281. Up to 2647 conditions per place. [2021-03-25 14:19:59,888 INFO L142 LiptonReduction]: Number of co-enabled transitions 2134 [2021-03-25 14:20:05,348 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:20:05,625 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:20:06,512 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 14:20:06,629 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 14:20:06,834 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:20:07,087 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:20:07,691 INFO L154 LiptonReduction]: Checked pairs total: 160 [2021-03-25 14:20:07,691 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 14:20:07,691 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8751 [2021-03-25 14:20:07,692 INFO L480 AbstractCegarLoop]: Abstraction has has 125 places, 106 transitions, 1196 flow [2021-03-25 14:20:07,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:20:07,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:20:07,692 INFO L263 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] [2021-03-25 14:20:07,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:20:07,692 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:20:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:20:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash -502304734, now seen corresponding path program 1 times [2021-03-25 14:20:07,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:20:07,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939578559] [2021-03-25 14:20:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:20:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:20:07,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:20:07,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:20:07,778 INFO L142 QuantifierPusher]: treesize reduction 4, result has 91.1 percent of original size [2021-03-25 14:20:07,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 14:20:07,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:20:07,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:20:07,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:20:07,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:20:07,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:20:07,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:20:07,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:20:07,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:20:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:20:07,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939578559] [2021-03-25 14:20:07,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:20:07,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:20:07,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907233884] [2021-03-25 14:20:07,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:20:07,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:20:07,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:20:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:20:07,862 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 220 [2021-03-25 14:20:07,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 106 transitions, 1196 flow. Second operand has 8 states, 8 states have (on average 159.125) internal successors, (1273), 8 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:20:07,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:20:07,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 220 [2021-03-25 14:20:07,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:20:08,514 INFO L129 PetriNetUnfolder]: 2173/5218 cut-off events. [2021-03-25 14:20:08,514 INFO L130 PetriNetUnfolder]: For 39901/42480 co-relation queries the response was YES. [2021-03-25 14:20:08,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26393 conditions, 5218 events. 2173/5218 cut-off events. For 39901/42480 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 52832 event pairs, 122 based on Foata normal form. 225/5098 useless extension candidates. Maximal degree in co-relation 26335. Up to 1684 conditions per place. [2021-03-25 14:20:08,547 INFO L132 encePairwiseOnDemand]: 214/220 looper letters, 16 selfloop transitions, 7 changer transitions 53/106 dead transitions. [2021-03-25 14:20:08,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 106 transitions, 1312 flow [2021-03-25 14:20:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:20:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:20:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2021-03-25 14:20:08,549 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2021-03-25 14:20:08,549 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2021-03-25 14:20:08,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2021-03-25 14:20:08,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:20:08,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2021-03-25 14:20:08,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:20:08,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:20:08,552 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:20:08,552 INFO L185 Difference]: Start difference. First operand has 125 places, 106 transitions, 1196 flow. Second operand 6 states and 968 transitions. [2021-03-25 14:20:08,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 106 transitions, 1312 flow [2021-03-25 14:20:08,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 1125 flow, removed 48 selfloop flow, removed 21 redundant places. [2021-03-25 14:20:08,984 INFO L241 Difference]: Finished difference. Result has 103 places, 52 transitions, 448 flow [2021-03-25 14:20:08,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=448, PETRI_PLACES=103, PETRI_TRANSITIONS=52} [2021-03-25 14:20:08,984 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 41 predicate places. [2021-03-25 14:20:08,984 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:20:08,984 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 52 transitions, 448 flow [2021-03-25 14:20:08,984 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 52 transitions, 448 flow [2021-03-25 14:20:08,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 52 transitions, 448 flow [2021-03-25 14:20:09,003 INFO L129 PetriNetUnfolder]: 101/260 cut-off events. [2021-03-25 14:20:09,004 INFO L130 PetriNetUnfolder]: For 1905/1947 co-relation queries the response was YES. [2021-03-25 14:20:09,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 260 events. 101/260 cut-off events. For 1905/1947 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1265 event pairs, 13 based on Foata normal form. 7/259 useless extension candidates. Maximal degree in co-relation 951. Up to 82 conditions per place. [2021-03-25 14:20:09,006 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-25 14:20:09,306 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-25 14:20:09,786 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2021-03-25 14:20:09,947 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-03-25 14:20:09,954 INFO L154 LiptonReduction]: Checked pairs total: 122 [2021-03-25 14:20:09,954 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:20:09,954 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 970 [2021-03-25 14:20:09,954 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 49 transitions, 442 flow [2021-03-25 14:20:09,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 159.125) internal successors, (1273), 8 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:20:09,955 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:20:09,955 INFO L263 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] [2021-03-25 14:20:09,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:20:09,955 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:20:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:20:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash 14702774, now seen corresponding path program 1 times [2021-03-25 14:20:09,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:20:09,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930336251] [2021-03-25 14:20:09,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:20:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:20:09,979 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:20:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:20:10,009 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:20:10,030 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:20:10,030 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:20:10,030 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 14:20:10,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:20:10 BasicIcfg [2021-03-25 14:20:10,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:20:10,114 INFO L168 Benchmark]: Toolchain (without parser) took 306600.28 ms. Allocated memory was 255.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 234.0 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. [2021-03-25 14:20:10,114 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:20:10,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.53 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 234.0 MB in the beginning and 314.4 MB in the end (delta: -80.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:20:10,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.61 ms. Allocated memory is still 356.5 MB. Free memory was 314.4 MB in the beginning and 311.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:20:10,115 INFO L168 Benchmark]: Boogie Preprocessor took 30.99 ms. Allocated memory is still 356.5 MB. Free memory was 311.6 MB in the beginning and 309.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:20:10,115 INFO L168 Benchmark]: RCFGBuilder took 1982.07 ms. Allocated memory is still 356.5 MB. Free memory was 308.8 MB in the beginning and 187.0 MB in the end (delta: 121.8 MB). Peak memory consumption was 126.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:20:10,115 INFO L168 Benchmark]: TraceAbstraction took 304135.41 ms. Allocated memory was 356.5 MB in the beginning and 4.0 GB in the end (delta: 3.7 GB). Free memory was 186.0 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. [2021-03-25 14:20:10,116 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 413.53 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 234.0 MB in the beginning and 314.4 MB in the end (delta: -80.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 34.61 ms. Allocated memory is still 356.5 MB. Free memory was 314.4 MB in the beginning and 311.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.99 ms. Allocated memory is still 356.5 MB. Free memory was 311.6 MB in the beginning and 309.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1982.07 ms. Allocated memory is still 356.5 MB. Free memory was 308.8 MB in the beginning and 187.0 MB in the end (delta: 121.8 MB). Peak memory consumption was 126.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 304135.41 ms. Allocated memory was 356.5 MB in the beginning and 4.0 GB in the end (delta: 3.7 GB). Free memory was 186.0 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3910.0ms, 127 PlacesBefore, 62 PlacesAfterwards, 116 TransitionsBefore, 50 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 5647 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2332, positive: 2210, positive conditional: 0, positive unconditional: 2210, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1714, positive: 1664, positive conditional: 0, positive unconditional: 1664, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1714, positive: 1664, positive conditional: 0, positive unconditional: 1664, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1714, positive: 1651, positive conditional: 0, positive unconditional: 1651, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 689, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 642, negative conditional: 0, negative unconditional: 642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2332, positive: 546, positive conditional: 0, positive unconditional: 546, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 1714, unknown conditional: 0, unknown unconditional: 1714] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 174, Positive conditional cache size: 0, Positive unconditional cache size: 174, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1369.3ms, 58 PlacesBefore, 46 PlacesAfterwards, 47 TransitionsBefore, 35 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 3042 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 656, positive: 524, positive conditional: 0, positive unconditional: 524, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, positive: 111, positive conditional: 0, positive unconditional: 111, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 138, positive: 111, positive conditional: 0, positive unconditional: 111, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 138, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 398, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 375, negative conditional: 0, negative unconditional: 375, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 656, positive: 413, positive conditional: 0, positive unconditional: 413, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 138, unknown conditional: 0, unknown unconditional: 138] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 178, Positive conditional cache size: 0, Positive unconditional cache size: 178, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 848.1ms, 49 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 30 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1710 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 387, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 387, positive: 277, positive conditional: 0, positive unconditional: 277, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1652.6ms, 46 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 158, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 213, Positive conditional cache size: 0, Positive unconditional cache size: 213, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 335.5ms, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 786 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 893 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 171, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 195, Positive conditional cache size: 0, Positive unconditional cache size: 195, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 601.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 290 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 195, Positive conditional cache size: 0, Positive unconditional cache size: 195, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36276.0ms, 64 PlacesBefore, 64 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 1534 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 249 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 195, Positive conditional cache size: 0, Positive unconditional cache size: 195, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8233.5ms, 73 PlacesBefore, 73 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 2330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 279 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 195, Positive conditional cache size: 0, Positive unconditional cache size: 195, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24711.2ms, 79 PlacesBefore, 79 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 2536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1126 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 156, positive: 146, positive conditional: 0, positive unconditional: 146, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, positive: 143, positive conditional: 0, positive unconditional: 143, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 206, Positive conditional cache size: 0, Positive unconditional cache size: 206, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19152.4ms, 81 PlacesBefore, 81 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 2520 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 380 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 206, Positive conditional cache size: 0, Positive unconditional cache size: 206, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43666.3ms, 91 PlacesBefore, 91 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 118, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 255, Positive conditional cache size: 0, Positive unconditional cache size: 255, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3712.8ms, 96 PlacesBefore, 96 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 2536 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 255, Positive conditional cache size: 0, Positive unconditional cache size: 255, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8378.2ms, 104 PlacesBefore, 104 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 2764 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 255, Positive conditional cache size: 0, Positive unconditional cache size: 255, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11090.8ms, 111 PlacesBefore, 111 PlacesAfterwards, 145 TransitionsBefore, 145 TransitionsAfterwards, 3004 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 255, Positive conditional cache size: 0, Positive unconditional cache size: 255, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38101.1ms, 121 PlacesBefore, 121 PlacesAfterwards, 171 TransitionsBefore, 171 TransitionsAfterwards, 3542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 10 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 258, Positive conditional cache size: 0, Positive unconditional cache size: 258, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8751.3ms, 131 PlacesBefore, 125 PlacesAfterwards, 111 TransitionsBefore, 106 TransitionsAfterwards, 2134 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 160 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 160, positive conditional: 0, positive unconditional: 160, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 227, Positive conditional cache size: 0, Positive unconditional cache size: 227, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 969.5ms, 103 PlacesBefore, 87 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 122 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t193; [L872] FCALL, FORK 0 pthread_create(&t193, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t194; [L874] FCALL, FORK 0 pthread_create(&t194, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t195; [L876] FCALL, FORK 0 pthread_create(&t195, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L877] 0 pthread_t t196; [L878] FCALL, FORK 0 pthread_create(&t196, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 303950.2ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 90261.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3982.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 142 SDtfs, 172 SDslu, 176 SDs, 0 SdLazy, 879 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1011.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 854.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2099occurred in iteration=14, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 39.0ms SsaConstructionTime, 316.6ms SatisfiabilityAnalysisTime, 1257.9ms InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 2662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...