/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:45:19,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:45:19,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:45:19,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:45:19,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:45:19,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:45:19,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:45:19,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:45:19,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:45:19,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:45:19,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:45:19,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:45:19,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:45:19,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:45:19,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:45:19,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:45:19,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:45:19,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:45:19,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:45:19,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:45:19,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:45:19,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:45:19,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:45:19,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:45:19,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:45:19,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:45:19,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:45:19,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:45:19,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:45:19,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:45:19,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:45:19,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:45:19,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:45:19,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:45:19,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:45:19,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:45:19,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:45:19,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:45:19,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:45:19,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:45:19,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:45:19,300 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:45:19,334 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:45:19,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:45:19,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:45:19,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:45:19,337 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:45:19,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:45:19,338 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:45:19,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:45:19,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:45:19,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:45:19,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:45:19,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:45:19,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:45:19,339 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:45:19,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:45:19,339 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:45:19,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:45:19,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:45:19,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:45:19,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:45:19,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:45:19,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:45:19,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:45:19,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:45:19,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:45:19,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:45:19,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:45:19,341 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:45:19,341 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:45:19,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:45:19,341 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-06-11 15:45:19,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:45:19,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:45:19,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:45:19,675 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:45:19,676 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:45:19,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2021-06-11 15:45:19,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4bbcfbb/b7179bffcfd94d629cc01eb811fd7f05/FLAGc6fe02714 [2021-06-11 15:45:20,288 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:45:20,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2021-06-11 15:45:20,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4bbcfbb/b7179bffcfd94d629cc01eb811fd7f05/FLAGc6fe02714 [2021-06-11 15:45:20,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4bbcfbb/b7179bffcfd94d629cc01eb811fd7f05 [2021-06-11 15:45:20,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:45:20,601 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:45:20,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:45:20,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:45:20,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:45:20,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:45:20" (1/1) ... [2021-06-11 15:45:20,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e513bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:20, skipping insertion in model container [2021-06-11 15:45:20,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:45:20" (1/1) ... [2021-06-11 15:45:20,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:45:20,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:45:20,804 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/mix037_tso.oepc.i[949,962] [2021-06-11 15:45:21,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:45:21,067 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:45:21,080 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/mix037_tso.oepc.i[949,962] [2021-06-11 15:45:21,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:45:21,209 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:45:21,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21 WrapperNode [2021-06-11 15:45:21,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:45:21,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:45:21,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:45:21,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:45:21,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (1/1) ... [2021-06-11 15:45:21,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (1/1) ... [2021-06-11 15:45:21,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:45:21,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:45:21,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:45:21,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:45:21,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (1/1) ... [2021-06-11 15:45:21,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (1/1) ... [2021-06-11 15:45:21,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (1/1) ... [2021-06-11 15:45:21,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (1/1) ... [2021-06-11 15:45:21,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (1/1) ... [2021-06-11 15:45:21,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (1/1) ... [2021-06-11 15:45:21,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (1/1) ... [2021-06-11 15:45:21,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:45:21,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:45:21,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:45:21,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:45:21,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (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-06-11 15:45:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:45:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:45:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:45:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:45:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:45:21,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:45:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:45:21,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:45:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:45:21,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:45:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 15:45:21,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 15:45:21,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:45:21,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:45:21,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:45:21,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:45:21,423 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:45:23,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:45:23,519 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:45:23,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:45:23 BoogieIcfgContainer [2021-06-11 15:45:23,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:45:23,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:45:23,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:45:23,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:45:23,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:45:20" (1/3) ... [2021-06-11 15:45:23,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559c4116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:45:23, skipping insertion in model container [2021-06-11 15:45:23,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:45:21" (2/3) ... [2021-06-11 15:45:23,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559c4116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:45:23, skipping insertion in model container [2021-06-11 15:45:23,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:45:23" (3/3) ... [2021-06-11 15:45:23,528 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2021-06-11 15:45:23,534 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:45:23,538 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:45:23,539 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:45:23,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,579 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,579 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,580 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,580 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,596 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,596 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,596 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,596 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,597 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,597 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,600 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,601 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,601 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,601 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,609 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,610 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,613 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,613 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,615 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,615 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,616 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,616 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,617 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:45:23,618 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:45:23,634 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 15:45:23,664 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:45:23,664 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:45:23,664 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:45:23,664 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:45:23,665 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:45:23,665 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:45:23,665 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:45:23,665 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:45:23,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-06-11 15:45:23,728 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-06-11 15:45:23,728 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:45:23,739 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 4. Compared 92 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-06-11 15:45:23,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-06-11 15:45:23,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-06-11 15:45:23,747 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:23,760 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-06-11 15:45:23,763 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-06-11 15:45:23,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-06-11 15:45:23,799 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-06-11 15:45:23,799 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:45:23,800 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 4. Compared 98 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-06-11 15:45:23,805 INFO L151 LiptonReduction]: Number of co-enabled transitions 2868 [2021-06-11 15:45:23,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:23,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:23,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:23,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:23,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:23,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:23,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:23,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:24,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:24,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:45:24,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,510 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:45:24,510 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:24,535 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:24,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:24,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:45:24,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:24,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:24,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:24,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:24,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:45:25,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:25,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:25,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:45:25,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,518 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:45:25,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:25,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:25,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:26,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:26,695 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:45:27,140 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 15:45:27,301 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 15:45:27,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,313 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:27,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:45:27,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:27,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,319 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:45:27,320 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:27,322 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,325 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 15:45:27,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:27,326 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 15:45:27,327 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 15:45:27,328 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:27,329 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,331 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 15:45:27,332 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 15:45:27,332 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:27,334 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,337 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 15:45:27,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,392 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:27,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:27,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:45:27,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:27,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:27,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:27,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:27,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:45:27,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:27,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:27,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:27,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:27,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:27,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:28,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,056 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:45:28,141 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.3 percent of original size [2021-06-11 15:45:28,150 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:45:28,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:45:28,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:45:28,167 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,172 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:45:28,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,174 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:45:28,175 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:45:28,175 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,177 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,177 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:45:28,178 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,179 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,180 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:45:28,180 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,181 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,184 INFO L147 QuantifierPusher]: treesize reduction 185, result has 40.1 percent of original size 124 [2021-06-11 15:45:28,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,187 INFO L142 QuantifierPusher]: treesize reduction 185, result has 55.3 percent of original size [2021-06-11 15:45:28,188 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 4, 3, 2, 1] term [2021-06-11 15:45:28,188 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,190 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,191 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 15:45:28,191 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,192 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,193 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2021-06-11 15:45:28,193 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,194 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,200 INFO L147 QuantifierPusher]: treesize reduction 378, result has 29.3 percent of original size 157 [2021-06-11 15:45:28,201 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:45:28,201 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,203 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,204 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:45:28,204 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,205 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,206 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:45:28,206 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,207 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:45:28,214 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:28,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,220 INFO L147 QuantifierPusher]: treesize reduction 36, result has 2.7 percent of original size 1 [2021-06-11 15:45:28,221 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 5, 3, 2, 1] term [2021-06-11 15:45:28,221 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,225 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,226 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 5, 1] term [2021-06-11 15:45:28,226 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:45:28,228 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,229 INFO L147 QuantifierPusher]: treesize reduction 127, result has 32.4 percent of original size 61 [2021-06-11 15:45:28,238 INFO L147 QuantifierPusher]: treesize reduction 1715, result has 15.6 percent of original size 317 [2021-06-11 15:45:28,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:28,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:28,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:28,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,568 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:45:28,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:28,572 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:45:28,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:45:28,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:28,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:45:28,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:45:28,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:28,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:28,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:28,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:29,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:29,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:29,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:29,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:29,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:45:29,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:29,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:29,811 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-06-11 15:45:29,993 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-11 15:45:30,375 WARN L205 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-06-11 15:45:30,529 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-11 15:45:30,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:30,539 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:45:30,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:30,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:30,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:45:30,560 INFO L163 LiptonReduction]: Checked pairs total: 8999 [2021-06-11 15:45:30,561 INFO L165 LiptonReduction]: Total number of compositions: 101 [2021-06-11 15:45:30,563 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6817 [2021-06-11 15:45:30,570 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2021-06-11 15:45:30,571 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:45:30,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:30,572 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 15:45:30,572 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:30,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1177354594, now seen corresponding path program 1 times [2021-06-11 15:45:30,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:30,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157433784] [2021-06-11 15:45:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:30,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:30,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:30,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157433784] [2021-06-11 15:45:30,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:30,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:45:30,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764714902] [2021-06-11 15:45:30,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:45:30,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:30,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:45:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:45:30,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 221 [2021-06-11 15:45:30,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:45:30,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:30,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 221 [2021-06-11 15:45:30,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:30,955 INFO L129 PetriNetUnfolder]: 133/303 cut-off events. [2021-06-11 15:45:30,955 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:45:30,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 303 events. 133/303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1609 event pairs, 87 based on Foata normal form. 45/306 useless extension candidates. Maximal degree in co-relation 511. Up to 153 conditions per place. [2021-06-11 15:45:30,961 INFO L132 encePairwiseOnDemand]: 216/221 looper letters, 11 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2021-06-11 15:45:30,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 114 flow [2021-06-11 15:45:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:45:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:45:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2021-06-11 15:45:30,979 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8642533936651584 [2021-06-11 15:45:30,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2021-06-11 15:45:30,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2021-06-11 15:45:30,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:30,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2021-06-11 15:45:30,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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-06-11 15:45:31,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-06-11 15:45:31,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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-06-11 15:45:31,002 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 573 transitions. [2021-06-11 15:45:31,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 114 flow [2021-06-11 15:45:31,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 15:45:31,006 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 78 flow [2021-06-11 15:45:31,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-06-11 15:45:31,009 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-06-11 15:45:31,009 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:31,009 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 78 flow [2021-06-11 15:45:31,010 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 78 flow [2021-06-11 15:45:31,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 78 flow [2021-06-11 15:45:31,014 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-06-11 15:45:31,015 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:45:31,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:45:31,017 INFO L151 LiptonReduction]: Number of co-enabled transitions 556 [2021-06-11 15:45:31,795 WARN L205 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 193 [2021-06-11 15:45:32,134 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-06-11 15:45:33,541 WARN L205 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 317 DAG size of output: 273 [2021-06-11 15:45:34,158 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-06-11 15:45:34,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:34,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:34,855 WARN L205 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 209 [2021-06-11 15:45:35,147 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 207 [2021-06-11 15:45:36,645 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 339 DAG size of output: 293 [2021-06-11 15:45:37,317 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 289 [2021-06-11 15:45:37,661 INFO L163 LiptonReduction]: Checked pairs total: 1256 [2021-06-11 15:45:37,661 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:45:37,662 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6653 [2021-06-11 15:45:37,662 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2021-06-11 15:45:37,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:45:37,663 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:37,663 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:37,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 15:45:37,663 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash -568198353, now seen corresponding path program 1 times [2021-06-11 15:45:37,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:37,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489088341] [2021-06-11 15:45:37,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:37,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:37,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:37,807 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-11 15:45:37,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:45:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:37,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489088341] [2021-06-11 15:45:37,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:37,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:45:37,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814466669] [2021-06-11 15:45:37,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:45:37,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:37,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:45:37,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:45:37,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 223 [2021-06-11 15:45:37,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 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-06-11 15:45:37,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:37,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 223 [2021-06-11 15:45:37,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:37,877 INFO L129 PetriNetUnfolder]: 1/34 cut-off events. [2021-06-11 15:45:37,877 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:45:37,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 44. Up to 3 conditions per place. [2021-06-11 15:45:37,878 INFO L132 encePairwiseOnDemand]: 219/223 looper letters, 1 selfloop transitions, 2 changer transitions 6/34 dead transitions. [2021-06-11 15:45:37,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 92 flow [2021-06-11 15:45:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:45:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:45:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 927 transitions. [2021-06-11 15:45:37,882 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.831390134529148 [2021-06-11 15:45:37,882 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 927 transitions. [2021-06-11 15:45:37,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 927 transitions. [2021-06-11 15:45:37,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:37,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 927 transitions. [2021-06-11 15:45:37,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.4) internal successors, (927), 5 states have internal predecessors, (927), 0 states have call successors, (0), 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-06-11 15:45:37,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 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-06-11 15:45:37,888 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 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-06-11 15:45:37,888 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 5 states and 927 transitions. [2021-06-11 15:45:37,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 92 flow [2021-06-11 15:45:37,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:45:37,890 INFO L241 Difference]: Finished difference. Result has 46 places, 28 transitions, 72 flow [2021-06-11 15:45:37,890 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2021-06-11 15:45:37,890 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-06-11 15:45:37,890 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:37,891 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 28 transitions, 72 flow [2021-06-11 15:45:37,891 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 28 transitions, 72 flow [2021-06-11 15:45:37,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-06-11 15:45:37,896 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-06-11 15:45:37,897 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:45:37,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:45:37,897 INFO L151 LiptonReduction]: Number of co-enabled transitions 410 [2021-06-11 15:45:37,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:37,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:38,094 INFO L163 LiptonReduction]: Checked pairs total: 949 [2021-06-11 15:45:38,095 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:45:38,095 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 205 [2021-06-11 15:45:38,096 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2021-06-11 15:45:38,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 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-06-11 15:45:38,096 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:38,096 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:38,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 15:45:38,097 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash -462898216, now seen corresponding path program 1 times [2021-06-11 15:45:38,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:38,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757006931] [2021-06-11 15:45:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:38,205 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 15:45:38,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:45:38,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:38,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:45:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:38,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757006931] [2021-06-11 15:45:38,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:38,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:45:38,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185818220] [2021-06-11 15:45:38,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:45:38,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:45:38,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:45:38,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 224 [2021-06-11 15:45:38,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 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-06-11 15:45:38,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:38,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 224 [2021-06-11 15:45:38,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:38,358 INFO L129 PetriNetUnfolder]: 205/371 cut-off events. [2021-06-11 15:45:38,358 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-11 15:45:38,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 371 events. 205/371 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1819 event pairs, 167 based on Foata normal form. 4/354 useless extension candidates. Maximal degree in co-relation 717. Up to 297 conditions per place. [2021-06-11 15:45:38,362 INFO L132 encePairwiseOnDemand]: 220/224 looper letters, 11 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-06-11 15:45:38,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 108 flow [2021-06-11 15:45:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:45:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:45:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2021-06-11 15:45:38,365 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7946428571428571 [2021-06-11 15:45:38,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2021-06-11 15:45:38,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2021-06-11 15:45:38,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:38,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2021-06-11 15:45:38,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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-06-11 15:45:38,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 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-06-11 15:45:38,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 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-06-11 15:45:38,369 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 3 states and 534 transitions. [2021-06-11 15:45:38,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 108 flow [2021-06-11 15:45:38,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:45:38,373 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 85 flow [2021-06-11 15:45:38,373 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-06-11 15:45:38,373 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-06-11 15:45:38,373 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:38,373 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 85 flow [2021-06-11 15:45:38,374 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 85 flow [2021-06-11 15:45:38,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 85 flow [2021-06-11 15:45:38,380 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-06-11 15:45:38,380 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 15:45:38,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-06-11 15:45:38,381 INFO L151 LiptonReduction]: Number of co-enabled transitions 432 [2021-06-11 15:45:38,690 INFO L163 LiptonReduction]: Checked pairs total: 396 [2021-06-11 15:45:38,691 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:38,691 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 318 [2021-06-11 15:45:38,692 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 85 flow [2021-06-11 15:45:38,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 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-06-11 15:45:38,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:38,692 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:38,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 15:45:38,693 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:38,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash -435442353, now seen corresponding path program 1 times [2021-06-11 15:45:38,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:38,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038220442] [2021-06-11 15:45:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:38,767 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-06-11 15:45:38,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:38,777 INFO L142 QuantifierPusher]: treesize reduction 40, result has 56.0 percent of original size [2021-06-11 15:45:38,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-06-11 15:45:38,800 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.6 percent of original size [2021-06-11 15:45:38,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-06-11 15:45:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:38,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038220442] [2021-06-11 15:45:38,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:38,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:45:38,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528195634] [2021-06-11 15:45:38,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:45:38,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:38,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:45:38,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:45:38,831 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 224 [2021-06-11 15:45:38,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 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-06-11 15:45:38,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:38,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 224 [2021-06-11 15:45:38,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:38,961 INFO L129 PetriNetUnfolder]: 215/389 cut-off events. [2021-06-11 15:45:38,962 INFO L130 PetriNetUnfolder]: For 113/115 co-relation queries the response was YES. [2021-06-11 15:45:38,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 389 events. 215/389 cut-off events. For 113/115 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1898 event pairs, 142 based on Foata normal form. 4/372 useless extension candidates. Maximal degree in co-relation 860. Up to 317 conditions per place. [2021-06-11 15:45:38,965 INFO L132 encePairwiseOnDemand]: 215/224 looper letters, 12 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2021-06-11 15:45:38,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 159 flow [2021-06-11 15:45:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:45:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:45:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 709 transitions. [2021-06-11 15:45:38,968 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7912946428571429 [2021-06-11 15:45:38,968 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 709 transitions. [2021-06-11 15:45:38,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 709 transitions. [2021-06-11 15:45:38,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:38,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 709 transitions. [2021-06-11 15:45:38,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 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-06-11 15:45:38,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:38,972 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:38,972 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 85 flow. Second operand 4 states and 709 transitions. [2021-06-11 15:45:38,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 159 flow [2021-06-11 15:45:38,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:45:38,974 INFO L241 Difference]: Finished difference. Result has 44 places, 38 transitions, 151 flow [2021-06-11 15:45:38,974 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2021-06-11 15:45:38,974 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-06-11 15:45:38,974 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:38,975 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 151 flow [2021-06-11 15:45:38,975 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 151 flow [2021-06-11 15:45:38,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 151 flow [2021-06-11 15:45:38,994 INFO L129 PetriNetUnfolder]: 42/151 cut-off events. [2021-06-11 15:45:38,994 INFO L130 PetriNetUnfolder]: For 66/68 co-relation queries the response was YES. [2021-06-11 15:45:38,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 151 events. 42/151 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 769 event pairs, 16 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 311. Up to 57 conditions per place. [2021-06-11 15:45:38,996 INFO L151 LiptonReduction]: Number of co-enabled transitions 558 [2021-06-11 15:45:39,000 INFO L163 LiptonReduction]: Checked pairs total: 382 [2021-06-11 15:45:39,000 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:39,000 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-06-11 15:45:39,001 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 151 flow [2021-06-11 15:45:39,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 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-06-11 15:45:39,002 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:39,002 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:39,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 15:45:39,002 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash -434145003, now seen corresponding path program 2 times [2021-06-11 15:45:39,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:39,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790164126] [2021-06-11 15:45:39,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:39,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:39,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:45:39,071 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 15:45:39,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 15:45:39,095 INFO L142 QuantifierPusher]: treesize reduction 11, result has 86.4 percent of original size [2021-06-11 15:45:39,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-06-11 15:45:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:39,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790164126] [2021-06-11 15:45:39,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:39,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:45:39,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932793392] [2021-06-11 15:45:39,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:45:39,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:39,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:45:39,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:45:39,129 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 224 [2021-06-11 15:45:39,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 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-06-11 15:45:39,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:39,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 224 [2021-06-11 15:45:39,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:39,285 INFO L129 PetriNetUnfolder]: 224/401 cut-off events. [2021-06-11 15:45:39,285 INFO L130 PetriNetUnfolder]: For 374/497 co-relation queries the response was YES. [2021-06-11 15:45:39,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 401 events. 224/401 cut-off events. For 374/497 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1924 event pairs, 145 based on Foata normal form. 18/402 useless extension candidates. Maximal degree in co-relation 1173. Up to 312 conditions per place. [2021-06-11 15:45:39,289 INFO L132 encePairwiseOnDemand]: 217/224 looper letters, 19 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2021-06-11 15:45:39,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 260 flow [2021-06-11 15:45:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:45:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:45:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 704 transitions. [2021-06-11 15:45:39,292 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7857142857142857 [2021-06-11 15:45:39,292 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 704 transitions. [2021-06-11 15:45:39,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 704 transitions. [2021-06-11 15:45:39,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:39,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 704 transitions. [2021-06-11 15:45:39,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 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-06-11 15:45:39,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:39,296 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:39,296 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 151 flow. Second operand 4 states and 704 transitions. [2021-06-11 15:45:39,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 260 flow [2021-06-11 15:45:39,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:45:39,299 INFO L241 Difference]: Finished difference. Result has 48 places, 45 transitions, 231 flow [2021-06-11 15:45:39,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2021-06-11 15:45:39,299 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2021-06-11 15:45:39,299 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:39,299 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 231 flow [2021-06-11 15:45:39,299 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 231 flow [2021-06-11 15:45:39,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 231 flow [2021-06-11 15:45:39,339 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][21], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), P2Thread1of1ForFork0InUse, 36#L765true, 165#true, 38#L815true, P0Thread1of1ForFork2InUse, 71#L785true, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), 55#L831true, Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,339 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 15:45:39,339 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 15:45:39,340 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 15:45:39,340 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 15:45:39,346 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][21], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), P2Thread1of1ForFork0InUse, 36#L765true, Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), 165#true, 38#L815true, P0Thread1of1ForFork2InUse, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), 55#L831true, 24#L795true, Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,347 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-06-11 15:45:39,347 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 15:45:39,347 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 15:45:39,347 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 15:45:39,349 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][21], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), 99#L841true, P2Thread1of1ForFork0InUse, 36#L765true, Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), 165#true, P0Thread1of1ForFork2InUse, 38#L815true, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), 24#L795true, Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,350 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-06-11 15:45:39,350 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 15:45:39,350 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 15:45:39,350 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 15:45:39,350 INFO L129 PetriNetUnfolder]: 164/353 cut-off events. [2021-06-11 15:45:39,350 INFO L130 PetriNetUnfolder]: For 505/582 co-relation queries the response was YES. [2021-06-11 15:45:39,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 353 events. 164/353 cut-off events. For 505/582 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1893 event pairs, 42 based on Foata normal form. 5/307 useless extension candidates. Maximal degree in co-relation 1031. Up to 223 conditions per place. [2021-06-11 15:45:39,356 INFO L151 LiptonReduction]: Number of co-enabled transitions 654 [2021-06-11 15:45:39,420 INFO L163 LiptonReduction]: Checked pairs total: 660 [2021-06-11 15:45:39,420 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:39,420 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 121 [2021-06-11 15:45:39,421 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 231 flow [2021-06-11 15:45:39,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 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-06-11 15:45:39,421 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:39,421 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:39,421 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 15:45:39,422 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:39,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:39,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1185958079, now seen corresponding path program 1 times [2021-06-11 15:45:39,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:39,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784990564] [2021-06-11 15:45:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:39,477 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 15:45:39,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:45:39,501 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 15:45:39,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 15:45:39,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:39,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:45:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:39,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784990564] [2021-06-11 15:45:39,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:39,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:45:39,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291124959] [2021-06-11 15:45:39,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:45:39,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:39,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:45:39,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:45:39,547 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 224 [2021-06-11 15:45:39,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:45:39,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:39,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 224 [2021-06-11 15:45:39,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:39,664 INFO L129 PetriNetUnfolder]: 204/388 cut-off events. [2021-06-11 15:45:39,665 INFO L130 PetriNetUnfolder]: For 633/1023 co-relation queries the response was YES. [2021-06-11 15:45:39,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 388 events. 204/388 cut-off events. For 633/1023 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1923 event pairs, 41 based on Foata normal form. 32/405 useless extension candidates. Maximal degree in co-relation 1331. Up to 256 conditions per place. [2021-06-11 15:45:39,669 INFO L132 encePairwiseOnDemand]: 220/224 looper letters, 28 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2021-06-11 15:45:39,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 335 flow [2021-06-11 15:45:39,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:45:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:45:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 711 transitions. [2021-06-11 15:45:39,671 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7935267857142857 [2021-06-11 15:45:39,672 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 711 transitions. [2021-06-11 15:45:39,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 711 transitions. [2021-06-11 15:45:39,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:39,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 711 transitions. [2021-06-11 15:45:39,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 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-06-11 15:45:39,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:39,675 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:39,676 INFO L185 Difference]: Start difference. First operand has 48 places, 45 transitions, 231 flow. Second operand 4 states and 711 transitions. [2021-06-11 15:45:39,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 335 flow [2021-06-11 15:45:39,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 318 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 15:45:39,678 INFO L241 Difference]: Finished difference. Result has 50 places, 45 transitions, 231 flow [2021-06-11 15:45:39,679 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2021-06-11 15:45:39,679 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2021-06-11 15:45:39,679 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:39,679 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 231 flow [2021-06-11 15:45:39,679 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 231 flow [2021-06-11 15:45:39,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 231 flow [2021-06-11 15:45:39,713 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][35], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), 99#L841true, Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), P2Thread1of1ForFork0InUse, 36#L765true, P0Thread1of1ForFork2InUse, 71#L785true, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 174#true, Black: 177#(and (= ~x~0 1) (= ~x$w_buff0_used~0 0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), 57#P2ENTRYtrue, Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,713 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2021-06-11 15:45:39,713 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-06-11 15:45:39,713 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-06-11 15:45:39,713 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-06-11 15:45:39,718 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][35], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), 99#L841true, Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), P2Thread1of1ForFork0InUse, 36#L765true, P0Thread1of1ForFork2InUse, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 174#true, Black: 177#(and (= ~x~0 1) (= ~x$w_buff0_used~0 0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), 24#L795true, 57#P2ENTRYtrue, Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,718 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 15:45:39,718 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 15:45:39,718 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 15:45:39,718 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 15:45:39,720 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][35], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), P2Thread1of1ForFork0InUse, 36#L765true, 38#L815true, P0Thread1of1ForFork2InUse, 71#L785true, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 174#true, Black: 177#(and (= ~x~0 1) (= ~x$w_buff0_used~0 0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), 55#L831true, Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,720 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-06-11 15:45:39,720 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 15:45:39,720 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 15:45:39,720 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 15:45:39,721 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][35], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), 99#L841true, P2Thread1of1ForFork0InUse, Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), P0Thread1of1ForFork2InUse, 38#L815true, 71#L785true, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 174#true, Black: 177#(and (= ~x~0 1) (= ~x$w_buff0_used~0 0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), 92#L758true, Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,721 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 15:45:39,721 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 15:45:39,721 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 15:45:39,721 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 15:45:39,724 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][35], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), 99#L841true, P2Thread1of1ForFork0InUse, 36#L765true, Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), P0Thread1of1ForFork2InUse, 38#L815true, 71#L785true, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 174#true, Black: 177#(and (= ~x~0 1) (= ~x$w_buff0_used~0 0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,724 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 15:45:39,724 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 15:45:39,724 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 15:45:39,724 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 15:45:39,725 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][35], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), P2Thread1of1ForFork0InUse, 36#L765true, Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), 38#L815true, P0Thread1of1ForFork2InUse, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 174#true, Black: 177#(and (= ~x~0 1) (= ~x$w_buff0_used~0 0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), 55#L831true, 24#L795true, Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,725 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-06-11 15:45:39,726 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 15:45:39,726 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 15:45:39,726 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 15:45:39,728 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd0~0_297 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_651 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd0~0_363 256) 0))) (let ((.cse11 (not .cse20)) (.cse1 (= (mod v_~weak$$choice2~0_126 256) 0)) (.cse14 (and .cse20 .cse17)) (.cse15 (and .cse20 .cse18)) (.cse19 (= (mod v_~x$w_buff0_used~0_827 256) 0))) (let ((.cse12 (or .cse20 .cse19)) (.cse5 (not .cse19)) (.cse7 (or .cse14 .cse15 .cse19)) (.cse2 (not .cse1)) (.cse4 (or .cse11 (not .cse18))) (.cse6 (or .cse11 (not .cse17)))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite55_153| |v_ULTIMATE.start_main_#t~ite55_152|))) (or (and (= v_~x$r_buff0_thd0~0_363 |v_ULTIMATE.start_main_#t~ite56_147|) .cse0 .cse1 (= v_~x$r_buff0_thd0~0_362 |v_ULTIMATE.start_main_#t~ite56_147|)) (and (= v_~x$r_buff0_thd0~0_363 v_~x$r_buff0_thd0~0_362) .cse2 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_147| |v_ULTIMATE.start_main_#t~ite56_146|)))) (= v_~x$flush_delayed~0_90 0) (= v_~weak$$choice2~0_126 |v_ULTIMATE.start_main_#t~nondet40_81|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite43_138|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_133| |v_ULTIMATE.start_main_#t~ite44_132|) (= v_~x$w_buff0~0_314 v_~x$w_buff0~0_313) .cse2 .cse3) (and (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite43_139| |v_ULTIMATE.start_main_#t~ite44_133|) (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite43_139|) .cse6) (and .cse7 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite44_133|) .cse3)) (= v_~x$w_buff0~0_313 |v_ULTIMATE.start_main_#t~ite44_133|) .cse1))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 0) (= |v_ULTIMATE.start_main_#t~nondet39_75| v_~weak$$choice0~0_55) (= v_ULTIMATE.start___VERIFIER_assert_~expression_45 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_139| |v_ULTIMATE.start_main_#t~ite58_138|))) (or (and (= v_~x$r_buff1_thd0~0_297 v_~x$r_buff1_thd0~0_296) .cse8 (= |v_ULTIMATE.start_main_#t~ite59_133| |v_ULTIMATE.start_main_#t~ite59_132|) .cse2) (and (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite59_133|) .cse8 (= v_~x$r_buff1_thd0~0_296 |v_ULTIMATE.start_main_#t~ite59_133|) .cse1))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= v_~__unbuffered_p2_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_100|) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite46_138|))) (or (and (= v_~x$w_buff1~0_296 v_~x$w_buff1~0_295) .cse9 (= |v_ULTIMATE.start_main_#t~ite47_129| |v_ULTIMATE.start_main_#t~ite47_128|) .cse2) (and (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_295) (or (and .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46_139| |v_ULTIMATE.start_main_#t~ite47_129|) (= |v_ULTIMATE.start_main_#t~ite46_139| v_~x$w_buff1~0_296) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite47_129| v_~x$w_buff1~0_296) .cse9)) .cse1))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite49_140|))) (or (and (= v_~x$w_buff0_used~0_826 |v_ULTIMATE.start_main_#t~ite50_137|) .cse1 (or (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite50_137|) .cse7 .cse10) (and .cse4 .cse5 (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite49_141| 0)) (and (= v_~x$w_buff0_used~0_827 |v_ULTIMATE.start_main_#t~ite49_141|) .cse12)) .cse6 (= |v_ULTIMATE.start_main_#t~ite49_141| |v_ULTIMATE.start_main_#t~ite50_137|)))) (and (= |v_ULTIMATE.start_main_#t~ite50_137| |v_ULTIMATE.start_main_#t~ite50_136|) (= v_~x$w_buff0_used~0_827 v_~x$w_buff0_used~0_826) .cse2 .cse10))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_473) .cse1) (and (= v_~x$mem_tmp~0_70 v_~x~0_473) .cse2)) (or (and (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41_111| v_~x$w_buff1~0_296)) (and .cse11 (= v_~x$w_buff0~0_314 |v_ULTIMATE.start_main_#t~ite41_111|))) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite42_100|) .cse6) (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_100| v_~x~0_474) (= |v_ULTIMATE.start_main_#t~ite41_111| |v_ULTIMATE.start_main_#t~ite41_110|))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite52_134|))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 v_~x$w_buff1_used~0_650) (= |v_ULTIMATE.start_main_#t~ite53_127| |v_ULTIMATE.start_main_#t~ite53_126|) .cse2) (and .cse1 (= v_~x$w_buff1_used~0_650 |v_ULTIMATE.start_main_#t~ite53_127|) (let ((.cse16 (= (mod v_~x$w_buff0_used~0_826 256) 0))) (or (and .cse13 (= v_~x$w_buff1_used~0_651 |v_ULTIMATE.start_main_#t~ite53_127|) (or .cse14 .cse15 .cse16)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite52_135| |v_ULTIMATE.start_main_#t~ite53_127|) (not .cse16) (= |v_ULTIMATE.start_main_#t~ite52_135| 0) .cse6)))))) (= v_~x$mem_tmp~0_70 v_~x~0_474) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_29| (mod v_~main$tmp_guard1~0_80 256)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_314, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_128|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_138|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_140|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_138|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_132|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_136|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_134|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_363, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_81|, ~x$w_buff1~0=v_~x$w_buff1~0_296, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_138|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_651, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_132|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_126|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_146|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_152|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_110|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_75|, ~x~0=v_~x~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$flush_delayed~0=v_~x$flush_delayed~0_90, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_127|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_137|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_139|, ~x$mem_tmp~0=v_~x$mem_tmp~0_70, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_80|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_137|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_99|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_74|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_131|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_135|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_133|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_45, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_80|, ~x$w_buff1~0=v_~x$w_buff1~0_295, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_137|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_76|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_131|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_82|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_125|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_145|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_151|, ~weak$$choice0~0=v_~weak$$choice0~0_55, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_78|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_109|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_74|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_74|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~x~0=v_~x~0_473} AuxVars[|v_ULTIMATE.start_main_#t~ite44_133|, |v_ULTIMATE.start_main_#t~ite55_153|, |v_ULTIMATE.start_main_#t~ite42_100|, |v_ULTIMATE.start_main_#t~ite59_133|, |v_ULTIMATE.start_main_#t~ite46_139|, |v_ULTIMATE.start_main_#t~ite50_137|, |v_ULTIMATE.start_main_#t~ite52_135|, |v_ULTIMATE.start_main_#t~ite41_111|, |v_ULTIMATE.start_main_#t~ite47_129|, |v_ULTIMATE.start_main_#t~ite58_139|, |v_ULTIMATE.start_main_#t~ite49_141|, |v_ULTIMATE.start_main_#t~ite53_127|, |v_ULTIMATE.start_main_#t~ite43_139|, |v_ULTIMATE.start_main_#t~ite56_147|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][35], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 160#(and (= 2 ~x$w_buff0~0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$w_buff1_used~0 0) (not (= ~x~0 ~x$w_buff0~0))), 99#L841true, Black: 159#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0)), P2Thread1of1ForFork0InUse, 36#L765true, 38#L815true, P0Thread1of1ForFork2InUse, Black: 169#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 174#true, Black: 177#(and (= ~x~0 1) (= ~x$w_buff0_used~0 0) (<= ~x$r_buff1_thd0~0 (* 256 (div ~x$r_buff1_thd0~0 256))) (< 0 (+ (div ~x$r_buff1_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 145#(= ~__unbuffered_p3_EAX~0 0), 24#L795true, Black: 153#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0)), 157#true]) [2021-06-11 15:45:39,728 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 15:45:39,728 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:45:39,728 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:45:39,729 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:45:39,729 INFO L129 PetriNetUnfolder]: 159/337 cut-off events. [2021-06-11 15:45:39,729 INFO L130 PetriNetUnfolder]: For 703/777 co-relation queries the response was YES. [2021-06-11 15:45:39,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 337 events. 159/337 cut-off events. For 703/777 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1683 event pairs, 36 based on Foata normal form. 6/306 useless extension candidates. Maximal degree in co-relation 1034. Up to 212 conditions per place. [2021-06-11 15:45:39,734 INFO L151 LiptonReduction]: Number of co-enabled transitions 654 [2021-06-11 15:45:39,740 INFO L163 LiptonReduction]: Checked pairs total: 660 [2021-06-11 15:45:39,740 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:39,740 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 61 [2021-06-11 15:45:39,741 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 231 flow [2021-06-11 15:45:39,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:45:39,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:39,742 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:39,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 15:45:39,742 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:39,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:39,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1937534044, now seen corresponding path program 1 times [2021-06-11 15:45:39,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:39,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673296541] [2021-06-11 15:45:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:39,801 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 15:45:39,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 15:45:39,830 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-06-11 15:45:39,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-11 15:45:39,863 INFO L142 QuantifierPusher]: treesize reduction 8, result has 81.8 percent of original size [2021-06-11 15:45:39,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 15:45:39,884 INFO L142 QuantifierPusher]: treesize reduction 8, result has 81.8 percent of original size [2021-06-11 15:45:39,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 15:45:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:39,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673296541] [2021-06-11 15:45:39,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:39,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:45:39,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511019262] [2021-06-11 15:45:39,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:45:39,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:39,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:45:39,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:45:39,909 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 224 [2021-06-11 15:45:39,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 0 states have call successors, (0), 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-06-11 15:45:39,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:39,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 224 [2021-06-11 15:45:39,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:40,093 INFO L129 PetriNetUnfolder]: 233/426 cut-off events. [2021-06-11 15:45:40,093 INFO L130 PetriNetUnfolder]: For 810/1200 co-relation queries the response was YES. [2021-06-11 15:45:40,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 426 events. 233/426 cut-off events. For 810/1200 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2034 event pairs, 63 based on Foata normal form. 36/451 useless extension candidates. Maximal degree in co-relation 1508. Up to 277 conditions per place. [2021-06-11 15:45:40,098 INFO L132 encePairwiseOnDemand]: 215/224 looper letters, 26 selfloop transitions, 15 changer transitions 0/59 dead transitions. [2021-06-11 15:45:40,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 386 flow [2021-06-11 15:45:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:45:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:45:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 875 transitions. [2021-06-11 15:45:40,101 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.78125 [2021-06-11 15:45:40,101 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 875 transitions. [2021-06-11 15:45:40,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 875 transitions. [2021-06-11 15:45:40,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:40,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 875 transitions. [2021-06-11 15:45:40,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:45:40,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-06-11 15:45:40,106 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-06-11 15:45:40,106 INFO L185 Difference]: Start difference. First operand has 50 places, 45 transitions, 231 flow. Second operand 5 states and 875 transitions. [2021-06-11 15:45:40,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 386 flow [2021-06-11 15:45:40,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 372 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 15:45:40,109 INFO L241 Difference]: Finished difference. Result has 54 places, 54 transitions, 326 flow [2021-06-11 15:45:40,109 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2021-06-11 15:45:40,109 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2021-06-11 15:45:40,109 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:40,110 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 54 transitions, 326 flow [2021-06-11 15:45:40,110 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 54 transitions, 326 flow [2021-06-11 15:45:40,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 326 flow [2021-06-11 15:45:40,164 INFO L129 PetriNetUnfolder]: 233/434 cut-off events. [2021-06-11 15:45:40,165 INFO L130 PetriNetUnfolder]: For 1225/1430 co-relation queries the response was YES. [2021-06-11 15:45:40,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 434 events. 233/434 cut-off events. For 1225/1430 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2104 event pairs, 67 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 1620. Up to 250 conditions per place. [2021-06-11 15:45:40,171 INFO L151 LiptonReduction]: Number of co-enabled transitions 792 [2021-06-11 15:45:40,180 INFO L163 LiptonReduction]: Checked pairs total: 996 [2021-06-11 15:45:40,180 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:40,180 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-06-11 15:45:40,181 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 326 flow [2021-06-11 15:45:40,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 0 states have call successors, (0), 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-06-11 15:45:40,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:40,181 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:40,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 15:45:40,182 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:40,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:40,182 INFO L82 PathProgramCache]: Analyzing trace with hash -302636420, now seen corresponding path program 2 times [2021-06-11 15:45:40,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:40,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091578188] [2021-06-11 15:45:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:40,237 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-06-11 15:45:40,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:45:40,245 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-06-11 15:45:40,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:40,255 INFO L142 QuantifierPusher]: treesize reduction 40, result has 54.0 percent of original size [2021-06-11 15:45:40,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-11 15:45:40,274 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 15:45:40,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 15:45:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:40,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091578188] [2021-06-11 15:45:40,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:40,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:45:40,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994704287] [2021-06-11 15:45:40,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:45:40,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:40,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:45:40,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:45:40,302 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 224 [2021-06-11 15:45:40,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 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-06-11 15:45:40,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:40,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 224 [2021-06-11 15:45:40,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:40,462 INFO L129 PetriNetUnfolder]: 257/471 cut-off events. [2021-06-11 15:45:40,462 INFO L130 PetriNetUnfolder]: For 1504/2239 co-relation queries the response was YES. [2021-06-11 15:45:40,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 471 events. 257/471 cut-off events. For 1504/2239 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2264 event pairs, 36 based on Foata normal form. 58/518 useless extension candidates. Maximal degree in co-relation 2113. Up to 301 conditions per place. [2021-06-11 15:45:40,467 INFO L132 encePairwiseOnDemand]: 215/224 looper letters, 33 selfloop transitions, 20 changer transitions 0/71 dead transitions. [2021-06-11 15:45:40,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 575 flow [2021-06-11 15:45:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:45:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:45:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 890 transitions. [2021-06-11 15:45:40,471 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7946428571428571 [2021-06-11 15:45:40,471 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 890 transitions. [2021-06-11 15:45:40,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 890 transitions. [2021-06-11 15:45:40,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:40,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 890 transitions. [2021-06-11 15:45:40,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 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-06-11 15:45:40,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-06-11 15:45:40,475 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-06-11 15:45:40,475 INFO L185 Difference]: Start difference. First operand has 54 places, 54 transitions, 326 flow. Second operand 5 states and 890 transitions. [2021-06-11 15:45:40,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 575 flow [2021-06-11 15:45:40,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 512 flow, removed 25 selfloop flow, removed 1 redundant places. [2021-06-11 15:45:40,480 INFO L241 Difference]: Finished difference. Result has 59 places, 67 transitions, 454 flow [2021-06-11 15:45:40,480 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=454, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2021-06-11 15:45:40,481 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2021-06-11 15:45:40,481 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:40,481 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 67 transitions, 454 flow [2021-06-11 15:45:40,481 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 67 transitions, 454 flow [2021-06-11 15:45:40,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 67 transitions, 454 flow [2021-06-11 15:45:40,581 INFO L129 PetriNetUnfolder]: 243/472 cut-off events. [2021-06-11 15:45:40,582 INFO L130 PetriNetUnfolder]: For 1812/2033 co-relation queries the response was YES. [2021-06-11 15:45:40,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 472 events. 243/472 cut-off events. For 1812/2033 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2392 event pairs, 43 based on Foata normal form. 16/467 useless extension candidates. Maximal degree in co-relation 1960. Up to 265 conditions per place. [2021-06-11 15:45:40,588 INFO L151 LiptonReduction]: Number of co-enabled transitions 918 [2021-06-11 15:45:40,600 INFO L163 LiptonReduction]: Checked pairs total: 1583 [2021-06-11 15:45:40,600 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:40,600 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 119 [2021-06-11 15:45:40,600 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 454 flow [2021-06-11 15:45:40,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 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-06-11 15:45:40,601 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:40,601 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:40,601 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 15:45:40,601 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash 466752190, now seen corresponding path program 3 times [2021-06-11 15:45:40,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:40,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831255965] [2021-06-11 15:45:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:40,650 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-06-11 15:45:40,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:45:40,658 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-06-11 15:45:40,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 15:45:40,684 INFO L142 QuantifierPusher]: treesize reduction 11, result has 85.9 percent of original size [2021-06-11 15:45:40,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-06-11 15:45:40,716 INFO L142 QuantifierPusher]: treesize reduction 11, result has 86.4 percent of original size [2021-06-11 15:45:40,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-06-11 15:45:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:40,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831255965] [2021-06-11 15:45:40,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:40,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:45:40,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829965849] [2021-06-11 15:45:40,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:45:40,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:40,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:45:40,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:45:40,753 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 224 [2021-06-11 15:45:40,754 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 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-06-11 15:45:40,754 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:40,754 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 224 [2021-06-11 15:45:40,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:40,975 INFO L129 PetriNetUnfolder]: 299/547 cut-off events. [2021-06-11 15:45:40,976 INFO L130 PetriNetUnfolder]: For 2853/3864 co-relation queries the response was YES. [2021-06-11 15:45:40,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 547 events. 299/547 cut-off events. For 2853/3864 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2715 event pairs, 35 based on Foata normal form. 91/627 useless extension candidates. Maximal degree in co-relation 2772. Up to 330 conditions per place. [2021-06-11 15:45:40,983 INFO L132 encePairwiseOnDemand]: 216/224 looper letters, 31 selfloop transitions, 30 changer transitions 0/79 dead transitions. [2021-06-11 15:45:40,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 79 transitions, 702 flow [2021-06-11 15:45:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:45:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:45:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1062 transitions. [2021-06-11 15:45:40,987 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7901785714285714 [2021-06-11 15:45:40,987 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1062 transitions. [2021-06-11 15:45:40,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1062 transitions. [2021-06-11 15:45:40,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:40,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1062 transitions. [2021-06-11 15:45:40,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 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-06-11 15:45:40,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 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-06-11 15:45:40,992 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 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-06-11 15:45:40,992 INFO L185 Difference]: Start difference. First operand has 59 places, 67 transitions, 454 flow. Second operand 6 states and 1062 transitions. [2021-06-11 15:45:40,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 79 transitions, 702 flow [2021-06-11 15:45:40,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 79 transitions, 665 flow, removed 12 selfloop flow, removed 1 redundant places. [2021-06-11 15:45:40,998 INFO L241 Difference]: Finished difference. Result has 64 places, 71 transitions, 556 flow [2021-06-11 15:45:40,999 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=556, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2021-06-11 15:45:40,999 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2021-06-11 15:45:40,999 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:40,999 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 71 transitions, 556 flow [2021-06-11 15:45:40,999 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 71 transitions, 556 flow [2021-06-11 15:45:41,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 71 transitions, 556 flow [2021-06-11 15:45:41,067 INFO L129 PetriNetUnfolder]: 292/556 cut-off events. [2021-06-11 15:45:41,068 INFO L130 PetriNetUnfolder]: For 3172/3628 co-relation queries the response was YES. [2021-06-11 15:45:41,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 556 events. 292/556 cut-off events. For 3172/3628 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2943 event pairs, 17 based on Foata normal form. 17/549 useless extension candidates. Maximal degree in co-relation 2757. Up to 331 conditions per place. [2021-06-11 15:45:41,076 INFO L151 LiptonReduction]: Number of co-enabled transitions 994 [2021-06-11 15:45:41,117 INFO L163 LiptonReduction]: Checked pairs total: 1826 [2021-06-11 15:45:41,117 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:41,117 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-06-11 15:45:41,118 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 556 flow [2021-06-11 15:45:41,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 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-06-11 15:45:41,119 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:41,119 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:41,120 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 15:45:41,120 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:41,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1423024116, now seen corresponding path program 1 times [2021-06-11 15:45:41,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:41,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534704123] [2021-06-11 15:45:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:41,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:41,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:41,187 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:45:41,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:41,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:41,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:41,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534704123] [2021-06-11 15:45:41,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:41,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:45:41,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839987513] [2021-06-11 15:45:41,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:45:41,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:41,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:45:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:45:41,197 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 224 [2021-06-11 15:45:41,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 556 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 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-06-11 15:45:41,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:41,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 224 [2021-06-11 15:45:41,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:41,387 INFO L129 PetriNetUnfolder]: 683/1229 cut-off events. [2021-06-11 15:45:41,387 INFO L130 PetriNetUnfolder]: For 6610/7347 co-relation queries the response was YES. [2021-06-11 15:45:41,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5315 conditions, 1229 events. 683/1229 cut-off events. For 6610/7347 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 7699 event pairs, 235 based on Foata normal form. 218/1358 useless extension candidates. Maximal degree in co-relation 5290. Up to 567 conditions per place. [2021-06-11 15:45:41,405 INFO L132 encePairwiseOnDemand]: 217/224 looper letters, 12 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2021-06-11 15:45:41,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 621 flow [2021-06-11 15:45:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:45:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:45:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 922 transitions. [2021-06-11 15:45:41,408 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8232142857142857 [2021-06-11 15:45:41,408 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 922 transitions. [2021-06-11 15:45:41,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 922 transitions. [2021-06-11 15:45:41,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:41,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 922 transitions. [2021-06-11 15:45:41,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.4) internal successors, (922), 5 states have internal predecessors, (922), 0 states have call successors, (0), 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-06-11 15:45:41,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-06-11 15:45:41,414 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-06-11 15:45:41,414 INFO L185 Difference]: Start difference. First operand has 64 places, 71 transitions, 556 flow. Second operand 5 states and 922 transitions. [2021-06-11 15:45:41,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 621 flow [2021-06-11 15:45:41,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 582 flow, removed 14 selfloop flow, removed 3 redundant places. [2021-06-11 15:45:41,424 INFO L241 Difference]: Finished difference. Result has 68 places, 79 transitions, 595 flow [2021-06-11 15:45:41,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=595, PETRI_PLACES=68, PETRI_TRANSITIONS=79} [2021-06-11 15:45:41,424 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2021-06-11 15:45:41,425 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:41,425 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 79 transitions, 595 flow [2021-06-11 15:45:41,425 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 79 transitions, 595 flow [2021-06-11 15:45:41,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 79 transitions, 595 flow [2021-06-11 15:45:41,624 INFO L129 PetriNetUnfolder]: 673/1225 cut-off events. [2021-06-11 15:45:41,624 INFO L130 PetriNetUnfolder]: For 4689/5247 co-relation queries the response was YES. [2021-06-11 15:45:41,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5242 conditions, 1225 events. 673/1225 cut-off events. For 4689/5247 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7724 event pairs, 160 based on Foata normal form. 50/1156 useless extension candidates. Maximal degree in co-relation 5216. Up to 560 conditions per place. [2021-06-11 15:45:41,646 INFO L151 LiptonReduction]: Number of co-enabled transitions 1238 [2021-06-11 15:45:41,660 INFO L163 LiptonReduction]: Checked pairs total: 1774 [2021-06-11 15:45:41,661 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:41,661 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 236 [2021-06-11 15:45:41,661 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 79 transitions, 595 flow [2021-06-11 15:45:41,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 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-06-11 15:45:41,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:41,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:41,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 15:45:41,662 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:41,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1971574535, now seen corresponding path program 1 times [2021-06-11 15:45:41,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:41,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36519453] [2021-06-11 15:45:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:41,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:41,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:41,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:41,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:41,726 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:45:41,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:41,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:41,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:41,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36519453] [2021-06-11 15:45:41,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:41,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:45:41,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080157737] [2021-06-11 15:45:41,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:45:41,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:41,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:45:41,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:45:41,736 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 224 [2021-06-11 15:45:41,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 79 transitions, 595 flow. Second operand has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 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-06-11 15:45:41,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:41,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 224 [2021-06-11 15:45:41,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:41,898 INFO L129 PetriNetUnfolder]: 387/821 cut-off events. [2021-06-11 15:45:41,898 INFO L130 PetriNetUnfolder]: For 4562/6551 co-relation queries the response was YES. [2021-06-11 15:45:41,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 821 events. 387/821 cut-off events. For 4562/6551 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5423 event pairs, 62 based on Foata normal form. 426/1187 useless extension candidates. Maximal degree in co-relation 3723. Up to 427 conditions per place. [2021-06-11 15:45:41,909 INFO L132 encePairwiseOnDemand]: 217/224 looper letters, 12 selfloop transitions, 19 changer transitions 0/86 dead transitions. [2021-06-11 15:45:41,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 683 flow [2021-06-11 15:45:41,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:45:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:45:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1291 transitions. [2021-06-11 15:45:41,913 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8233418367346939 [2021-06-11 15:45:41,913 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1291 transitions. [2021-06-11 15:45:41,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1291 transitions. [2021-06-11 15:45:41,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:41,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1291 transitions. [2021-06-11 15:45:41,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 184.42857142857142) internal successors, (1291), 7 states have internal predecessors, (1291), 0 states have call successors, (0), 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-06-11 15:45:41,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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-06-11 15:45:41,919 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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-06-11 15:45:41,919 INFO L185 Difference]: Start difference. First operand has 68 places, 79 transitions, 595 flow. Second operand 7 states and 1291 transitions. [2021-06-11 15:45:41,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 683 flow [2021-06-11 15:45:41,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:45:41,927 INFO L241 Difference]: Finished difference. Result has 76 places, 82 transitions, 682 flow [2021-06-11 15:45:41,927 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=682, PETRI_PLACES=76, PETRI_TRANSITIONS=82} [2021-06-11 15:45:41,927 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2021-06-11 15:45:41,927 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:41,927 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 82 transitions, 682 flow [2021-06-11 15:45:41,928 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 82 transitions, 682 flow [2021-06-11 15:45:41,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 82 transitions, 682 flow [2021-06-11 15:45:42,020 INFO L129 PetriNetUnfolder]: 396/837 cut-off events. [2021-06-11 15:45:42,020 INFO L130 PetriNetUnfolder]: For 4786/6225 co-relation queries the response was YES. [2021-06-11 15:45:42,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4218 conditions, 837 events. 396/837 cut-off events. For 4786/6225 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5570 event pairs, 46 based on Foata normal form. 71/839 useless extension candidates. Maximal degree in co-relation 4188. Up to 434 conditions per place. [2021-06-11 15:45:42,037 INFO L151 LiptonReduction]: Number of co-enabled transitions 1410 [2021-06-11 15:45:42,048 INFO L163 LiptonReduction]: Checked pairs total: 1496 [2021-06-11 15:45:42,048 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:42,049 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 122 [2021-06-11 15:45:42,051 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 682 flow [2021-06-11 15:45:42,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 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-06-11 15:45:42,051 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:42,052 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:45:42,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 15:45:42,052 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2053512685, now seen corresponding path program 1 times [2021-06-11 15:45:42,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:42,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513202948] [2021-06-11 15:45:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:42,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:42,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:42,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:42,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:42,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:42,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:42,151 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:45:42,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:42,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:42,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:42,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513202948] [2021-06-11 15:45:42,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:42,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:45:42,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273635758] [2021-06-11 15:45:42,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:45:42,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:45:42,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:45:42,162 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 224 [2021-06-11 15:45:42,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 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-06-11 15:45:42,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:42,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 224 [2021-06-11 15:45:42,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:42,318 INFO L129 PetriNetUnfolder]: 267/631 cut-off events. [2021-06-11 15:45:42,318 INFO L130 PetriNetUnfolder]: For 5238/9506 co-relation queries the response was YES. [2021-06-11 15:45:42,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3407 conditions, 631 events. 267/631 cut-off events. For 5238/9506 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4222 event pairs, 11 based on Foata normal form. 530/1107 useless extension candidates. Maximal degree in co-relation 3375. Up to 404 conditions per place. [2021-06-11 15:45:42,327 INFO L132 encePairwiseOnDemand]: 217/224 looper letters, 6 selfloop transitions, 28 changer transitions 4/87 dead transitions. [2021-06-11 15:45:42,328 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 87 transitions, 805 flow [2021-06-11 15:45:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:45:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:45:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1660 transitions. [2021-06-11 15:45:42,332 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8234126984126984 [2021-06-11 15:45:42,332 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1660 transitions. [2021-06-11 15:45:42,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1660 transitions. [2021-06-11 15:45:42,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:42,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1660 transitions. [2021-06-11 15:45:42,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 184.44444444444446) internal successors, (1660), 9 states have internal predecessors, (1660), 0 states have call successors, (0), 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-06-11 15:45:42,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 224.0) internal successors, (2240), 10 states have internal predecessors, (2240), 0 states have call successors, (0), 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-06-11 15:45:42,340 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 224.0) internal successors, (2240), 10 states have internal predecessors, (2240), 0 states have call successors, (0), 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-06-11 15:45:42,340 INFO L185 Difference]: Start difference. First operand has 76 places, 82 transitions, 682 flow. Second operand 9 states and 1660 transitions. [2021-06-11 15:45:42,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 87 transitions, 805 flow [2021-06-11 15:45:42,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 87 transitions, 722 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-06-11 15:45:42,351 INFO L241 Difference]: Finished difference. Result has 80 places, 83 transitions, 698 flow [2021-06-11 15:45:42,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=698, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2021-06-11 15:45:42,351 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2021-06-11 15:45:42,351 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:42,351 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 83 transitions, 698 flow [2021-06-11 15:45:42,352 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 83 transitions, 698 flow [2021-06-11 15:45:42,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 83 transitions, 698 flow [2021-06-11 15:45:42,411 INFO L129 PetriNetUnfolder]: 259/618 cut-off events. [2021-06-11 15:45:42,411 INFO L130 PetriNetUnfolder]: For 3812/4443 co-relation queries the response was YES. [2021-06-11 15:45:42,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 618 events. 259/618 cut-off events. For 3812/4443 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4102 event pairs, 10 based on Foata normal form. 32/598 useless extension candidates. Maximal degree in co-relation 2981. Up to 248 conditions per place. [2021-06-11 15:45:42,424 INFO L151 LiptonReduction]: Number of co-enabled transitions 1512 [2021-06-11 15:45:42,444 INFO L163 LiptonReduction]: Checked pairs total: 1490 [2021-06-11 15:45:42,444 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:42,444 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 93 [2021-06-11 15:45:42,445 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 698 flow [2021-06-11 15:45:42,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 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-06-11 15:45:42,445 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:42,446 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-06-11 15:45:42,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 15:45:42,446 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:42,446 INFO L82 PathProgramCache]: Analyzing trace with hash -122039668, now seen corresponding path program 1 times [2021-06-11 15:45:42,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:42,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322120822] [2021-06-11 15:45:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:42,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:42,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:42,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:42,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:42,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:42,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:42,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322120822] [2021-06-11 15:45:42,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:42,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:45:42,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738876605] [2021-06-11 15:45:42,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:45:42,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:45:42,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:45:42,546 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 224 [2021-06-11 15:45:42,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 698 flow. Second operand has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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-06-11 15:45:42,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:42,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 224 [2021-06-11 15:45:42,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:42,772 INFO L129 PetriNetUnfolder]: 507/1188 cut-off events. [2021-06-11 15:45:42,773 INFO L130 PetriNetUnfolder]: For 7423/8689 co-relation queries the response was YES. [2021-06-11 15:45:42,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5780 conditions, 1188 events. 507/1188 cut-off events. For 7423/8689 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 9167 event pairs, 20 based on Foata normal form. 76/1162 useless extension candidates. Maximal degree in co-relation 5747. Up to 487 conditions per place. [2021-06-11 15:45:42,791 INFO L132 encePairwiseOnDemand]: 221/224 looper letters, 4 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2021-06-11 15:45:42,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 728 flow [2021-06-11 15:45:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:45:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:45:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 779 transitions. [2021-06-11 15:45:42,795 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8694196428571429 [2021-06-11 15:45:42,795 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 779 transitions. [2021-06-11 15:45:42,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 779 transitions. [2021-06-11 15:45:42,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:42,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 779 transitions. [2021-06-11 15:45:42,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 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-06-11 15:45:42,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:42,807 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:42,807 INFO L185 Difference]: Start difference. First operand has 80 places, 83 transitions, 698 flow. Second operand 4 states and 779 transitions. [2021-06-11 15:45:42,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 728 flow [2021-06-11 15:45:42,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 631 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-06-11 15:45:42,862 INFO L241 Difference]: Finished difference. Result has 81 places, 84 transitions, 614 flow [2021-06-11 15:45:42,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=614, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2021-06-11 15:45:42,862 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 33 predicate places. [2021-06-11 15:45:42,862 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:42,862 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 84 transitions, 614 flow [2021-06-11 15:45:42,863 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 84 transitions, 614 flow [2021-06-11 15:45:42,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 84 transitions, 614 flow [2021-06-11 15:45:43,003 INFO L129 PetriNetUnfolder]: 507/1182 cut-off events. [2021-06-11 15:45:43,004 INFO L130 PetriNetUnfolder]: For 4257/4677 co-relation queries the response was YES. [2021-06-11 15:45:43,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4625 conditions, 1182 events. 507/1182 cut-off events. For 4257/4677 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 9118 event pairs, 18 based on Foata normal form. 58/1150 useless extension candidates. Maximal degree in co-relation 4592. Up to 275 conditions per place. [2021-06-11 15:45:43,031 INFO L151 LiptonReduction]: Number of co-enabled transitions 1552 [2021-06-11 15:45:43,055 INFO L163 LiptonReduction]: Checked pairs total: 882 [2021-06-11 15:45:43,055 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:43,056 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 194 [2021-06-11 15:45:43,056 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 614 flow [2021-06-11 15:45:43,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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-06-11 15:45:43,057 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:43,057 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-06-11 15:45:43,057 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 15:45:43,058 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash 221194734, now seen corresponding path program 2 times [2021-06-11 15:45:43,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:43,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017031275] [2021-06-11 15:45:43,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:43,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:43,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:43,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:43,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:43,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:43,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:43,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:43,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:43,146 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:45:43,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:45:43,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:43,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:43,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017031275] [2021-06-11 15:45:43,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:43,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:45:43,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215462037] [2021-06-11 15:45:43,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:45:43,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:43,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:45:43,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:45:43,159 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 224 [2021-06-11 15:45:43,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 614 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-06-11 15:45:43,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:43,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 224 [2021-06-11 15:45:43,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:43,396 INFO L129 PetriNetUnfolder]: 479/1128 cut-off events. [2021-06-11 15:45:43,396 INFO L130 PetriNetUnfolder]: For 6105/9332 co-relation queries the response was YES. [2021-06-11 15:45:43,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4999 conditions, 1128 events. 479/1128 cut-off events. For 6105/9332 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 8717 event pairs, 10 based on Foata normal form. 857/1885 useless extension candidates. Maximal degree in co-relation 4964. Up to 275 conditions per place. [2021-06-11 15:45:43,409 INFO L132 encePairwiseOnDemand]: 217/224 looper letters, 2 selfloop transitions, 33 changer transitions 4/89 dead transitions. [2021-06-11 15:45:43,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 748 flow [2021-06-11 15:45:43,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 15:45:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 15:45:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2021 transitions. [2021-06-11 15:45:43,415 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.820211038961039 [2021-06-11 15:45:43,415 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2021 transitions. [2021-06-11 15:45:43,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2021 transitions. [2021-06-11 15:45:43,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:43,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2021 transitions. [2021-06-11 15:45:43,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 183.72727272727272) internal successors, (2021), 11 states have internal predecessors, (2021), 0 states have call successors, (0), 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-06-11 15:45:43,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 224.0) internal successors, (2688), 12 states have internal predecessors, (2688), 0 states have call successors, (0), 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-06-11 15:45:43,424 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 224.0) internal successors, (2688), 12 states have internal predecessors, (2688), 0 states have call successors, (0), 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-06-11 15:45:43,424 INFO L185 Difference]: Start difference. First operand has 81 places, 84 transitions, 614 flow. Second operand 11 states and 2021 transitions. [2021-06-11 15:45:43,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 748 flow [2021-06-11 15:45:43,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 727 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-06-11 15:45:43,455 INFO L241 Difference]: Finished difference. Result has 91 places, 85 transitions, 687 flow [2021-06-11 15:45:43,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=687, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2021-06-11 15:45:43,455 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 43 predicate places. [2021-06-11 15:45:43,455 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:43,455 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 85 transitions, 687 flow [2021-06-11 15:45:43,455 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 85 transitions, 687 flow [2021-06-11 15:45:43,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 687 flow [2021-06-11 15:45:43,555 INFO L129 PetriNetUnfolder]: 473/1114 cut-off events. [2021-06-11 15:45:43,555 INFO L130 PetriNetUnfolder]: For 4127/4730 co-relation queries the response was YES. [2021-06-11 15:45:43,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 1114 events. 473/1114 cut-off events. For 4127/4730 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 8824 event pairs, 8 based on Foata normal form. 54/1080 useless extension candidates. Maximal degree in co-relation 4900. Up to 275 conditions per place. [2021-06-11 15:45:43,577 INFO L151 LiptonReduction]: Number of co-enabled transitions 1520 [2021-06-11 15:45:43,600 INFO L163 LiptonReduction]: Checked pairs total: 1004 [2021-06-11 15:45:43,600 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:45:43,600 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 145 [2021-06-11 15:45:43,601 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 687 flow [2021-06-11 15:45:43,601 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-06-11 15:45:43,601 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:43,601 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] [2021-06-11 15:45:43,601 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-11 15:45:43,601 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1902610379, now seen corresponding path program 1 times [2021-06-11 15:45:43,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:43,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278912933] [2021-06-11 15:45:43,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:43,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:43,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:43,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:43,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:43,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:43,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:43,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278912933] [2021-06-11 15:45:43,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:43,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:45:43,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716849430] [2021-06-11 15:45:43,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:45:43,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:43,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:45:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:45:43,691 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 224 [2021-06-11 15:45:43,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 687 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 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-06-11 15:45:43,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:43,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 224 [2021-06-11 15:45:43,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:43,988 INFO L129 PetriNetUnfolder]: 938/2187 cut-off events. [2021-06-11 15:45:43,988 INFO L130 PetriNetUnfolder]: For 7730/9079 co-relation queries the response was YES. [2021-06-11 15:45:44,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9661 conditions, 2187 events. 938/2187 cut-off events. For 7730/9079 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 19115 event pairs, 20 based on Foata normal form. 123/2132 useless extension candidates. Maximal degree in co-relation 9624. Up to 545 conditions per place. [2021-06-11 15:45:44,013 INFO L132 encePairwiseOnDemand]: 221/224 looper letters, 3 selfloop transitions, 1 changer transitions 1/86 dead transitions. [2021-06-11 15:45:44,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 86 transitions, 699 flow [2021-06-11 15:45:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:45:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:45:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 750 transitions. [2021-06-11 15:45:44,016 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8370535714285714 [2021-06-11 15:45:44,016 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 750 transitions. [2021-06-11 15:45:44,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 750 transitions. [2021-06-11 15:45:44,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:44,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 750 transitions. [2021-06-11 15:45:44,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.5) internal successors, (750), 4 states have internal predecessors, (750), 0 states have call successors, (0), 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-06-11 15:45:44,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:44,019 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06-11 15:45:44,020 INFO L185 Difference]: Start difference. First operand has 90 places, 85 transitions, 687 flow. Second operand 4 states and 750 transitions. [2021-06-11 15:45:44,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 86 transitions, 699 flow [2021-06-11 15:45:44,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 581 flow, removed 26 selfloop flow, removed 11 redundant places. [2021-06-11 15:45:44,142 INFO L241 Difference]: Finished difference. Result has 84 places, 85 transitions, 576 flow [2021-06-11 15:45:44,142 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=576, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2021-06-11 15:45:44,143 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 36 predicate places. [2021-06-11 15:45:44,143 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:44,143 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 85 transitions, 576 flow [2021-06-11 15:45:44,143 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 85 transitions, 576 flow [2021-06-11 15:45:44,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 85 transitions, 576 flow [2021-06-11 15:45:44,266 INFO L129 PetriNetUnfolder]: 571/1395 cut-off events. [2021-06-11 15:45:44,266 INFO L130 PetriNetUnfolder]: For 3490/4312 co-relation queries the response was YES. [2021-06-11 15:45:44,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5205 conditions, 1395 events. 571/1395 cut-off events. For 3490/4312 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 11830 event pairs, 6 based on Foata normal form. 84/1347 useless extension candidates. Maximal degree in co-relation 5178. Up to 340 conditions per place. [2021-06-11 15:45:44,291 INFO L151 LiptonReduction]: Number of co-enabled transitions 1472 [2021-06-11 15:45:44,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:44,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:44,405 INFO L163 LiptonReduction]: Checked pairs total: 904 [2021-06-11 15:45:44,405 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:45:44,405 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 262 [2021-06-11 15:45:44,409 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 577 flow [2021-06-11 15:45:44,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 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-06-11 15:45:44,409 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:44,409 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] [2021-06-11 15:45:44,409 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-11 15:45:44,410 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:44,410 INFO L82 PathProgramCache]: Analyzing trace with hash -127784541, now seen corresponding path program 2 times [2021-06-11 15:45:44,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:44,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482797547] [2021-06-11 15:45:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:45:44,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:44,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:44,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:44,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:44,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:44,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:45:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:45:44,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482797547] [2021-06-11 15:45:44,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:45:44,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:45:44,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085211372] [2021-06-11 15:45:44,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:45:44,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:45:44,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:45:44,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:45:44,513 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 226 [2021-06-11 15:45:44,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 577 flow. Second operand has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 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-06-11 15:45:44,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:45:44,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 226 [2021-06-11 15:45:44,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:45:44,760 INFO L129 PetriNetUnfolder]: 982/2356 cut-off events. [2021-06-11 15:45:44,761 INFO L130 PetriNetUnfolder]: For 5447/6307 co-relation queries the response was YES. [2021-06-11 15:45:44,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8866 conditions, 2356 events. 982/2356 cut-off events. For 5447/6307 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 21489 event pairs, 20 based on Foata normal form. 135/2318 useless extension candidates. Maximal degree in co-relation 8837. Up to 600 conditions per place. [2021-06-11 15:45:44,785 INFO L132 encePairwiseOnDemand]: 223/226 looper letters, 3 selfloop transitions, 1 changer transitions 18/85 dead transitions. [2021-06-11 15:45:44,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 85 transitions, 589 flow [2021-06-11 15:45:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:45:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:45:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 762 transitions. [2021-06-11 15:45:44,787 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8429203539823009 [2021-06-11 15:45:44,788 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 762 transitions. [2021-06-11 15:45:44,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 762 transitions. [2021-06-11 15:45:44,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:45:44,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 762 transitions. [2021-06-11 15:45:44,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.5) internal successors, (762), 4 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:45:44,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 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-06-11 15:45:44,791 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 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-06-11 15:45:44,791 INFO L185 Difference]: Start difference. First operand has 82 places, 84 transitions, 577 flow. Second operand 4 states and 762 transitions. [2021-06-11 15:45:44,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 85 transitions, 589 flow [2021-06-11 15:45:44,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 85 transitions, 585 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 15:45:44,923 INFO L241 Difference]: Finished difference. Result has 85 places, 67 transitions, 460 flow [2021-06-11 15:45:44,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=460, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2021-06-11 15:45:44,923 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 37 predicate places. [2021-06-11 15:45:44,923 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:45:44,924 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 67 transitions, 460 flow [2021-06-11 15:45:44,924 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 67 transitions, 460 flow [2021-06-11 15:45:44,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 67 transitions, 460 flow [2021-06-11 15:45:45,025 INFO L129 PetriNetUnfolder]: 481/1202 cut-off events. [2021-06-11 15:45:45,025 INFO L130 PetriNetUnfolder]: For 2800/3262 co-relation queries the response was YES. [2021-06-11 15:45:45,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4587 conditions, 1202 events. 481/1202 cut-off events. For 2800/3262 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 10259 event pairs, 10 based on Foata normal form. 50/1170 useless extension candidates. Maximal degree in co-relation 4559. Up to 330 conditions per place. [2021-06-11 15:45:45,043 INFO L151 LiptonReduction]: Number of co-enabled transitions 846 [2021-06-11 15:45:45,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:45:45,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:45:45,100 INFO L163 LiptonReduction]: Checked pairs total: 41 [2021-06-11 15:45:45,100 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:45:45,100 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 177 [2021-06-11 15:45:45,101 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 458 flow [2021-06-11 15:45:45,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 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-06-11 15:45:45,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:45:45,135 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-06-11 15:45:45,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-11 15:45:45,135 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:45:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:45:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash 468802110, now seen corresponding path program 1 times [2021-06-11 15:45:45,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:45:45,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359109606] [2021-06-11 15:45:45,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:45:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:45:45,211 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:45:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:45:45,257 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:45:45,300 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:45:45,301 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:45:45,301 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-11 15:45:45,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:45:45 BasicIcfg [2021-06-11 15:45:45,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:45:45,419 INFO L168 Benchmark]: Toolchain (without parser) took 24818.28 ms. Allocated memory was 373.3 MB in the beginning and 864.0 MB in the end (delta: 490.7 MB). Free memory was 335.8 MB in the beginning and 769.5 MB in the end (delta: -433.8 MB). Peak memory consumption was 57.4 MB. Max. memory is 16.0 GB. [2021-06-11 15:45:45,419 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 373.3 MB. Free memory is still 354.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:45:45,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.79 ms. Allocated memory is still 373.3 MB. Free memory was 335.6 MB in the beginning and 331.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-06-11 15:45:45,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.56 ms. Allocated memory is still 373.3 MB. Free memory was 331.9 MB in the beginning and 328.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:45:45,420 INFO L168 Benchmark]: Boogie Preprocessor took 29.97 ms. Allocated memory is still 373.3 MB. Free memory was 328.8 MB in the beginning and 326.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:45:45,420 INFO L168 Benchmark]: RCFGBuilder took 2193.34 ms. Allocated memory is still 373.3 MB. Free memory was 326.7 MB in the beginning and 221.3 MB in the end (delta: 105.4 MB). Peak memory consumption was 133.6 MB. Max. memory is 16.0 GB. [2021-06-11 15:45:45,421 INFO L168 Benchmark]: TraceAbstraction took 21895.14 ms. Allocated memory was 373.3 MB in the beginning and 864.0 MB in the end (delta: 490.7 MB). Free memory was 220.3 MB in the beginning and 769.5 MB in the end (delta: -549.2 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:45:45,427 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.18 ms. Allocated memory is still 373.3 MB. Free memory is still 354.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 609.79 ms. Allocated memory is still 373.3 MB. Free memory was 335.6 MB in the beginning and 331.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 84.56 ms. Allocated memory is still 373.3 MB. Free memory was 331.9 MB in the beginning and 328.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.97 ms. Allocated memory is still 373.3 MB. Free memory was 328.8 MB in the beginning and 326.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2193.34 ms. Allocated memory is still 373.3 MB. Free memory was 326.7 MB in the beginning and 221.3 MB in the end (delta: 105.4 MB). Peak memory consumption was 133.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21895.14 ms. Allocated memory was 373.3 MB in the beginning and 864.0 MB in the end (delta: 490.7 MB). Free memory was 220.3 MB in the beginning and 769.5 MB in the end (delta: -549.2 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6797.9ms, 127 PlacesBefore, 48 PlacesAfterwards, 116 TransitionsBefore, 36 TransitionsAfterwards, 2868 CoEnabledTransitionPairs, 8 FixpointIterations, 42 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 8999 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3959, positive: 3725, positive conditional: 3725, positive unconditional: 0, negative: 234, negative conditional: 234, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3959, positive: 3725, positive conditional: 0, positive unconditional: 3725, negative: 234, negative conditional: 0, negative unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3959, positive: 3725, positive conditional: 0, positive unconditional: 3725, negative: 234, negative conditional: 0, negative unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2170, positive: 2114, positive conditional: 0, positive unconditional: 2114, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2170, positive: 2082, positive conditional: 0, positive unconditional: 2082, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 910, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 836, negative conditional: 0, negative unconditional: 836, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3959, positive: 1611, positive conditional: 0, positive unconditional: 1611, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 2170, unknown conditional: 0, unknown unconditional: 2170] , Statistics on independence cache: Total cache size (in pairs): 2170, Positive cache size: 2114, Positive conditional cache size: 0, Positive unconditional cache size: 2114, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6651.2ms, 44 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1256 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, positive: 311, positive conditional: 311, positive unconditional: 0, negative: 58, negative conditional: 58, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, positive: 311, positive conditional: 19, positive unconditional: 292, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, positive: 311, positive conditional: 19, positive unconditional: 292, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, positive: 43, positive conditional: 2, positive unconditional: 41, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 54, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 374, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 328, negative conditional: 0, negative unconditional: 328, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 369, positive: 268, positive conditional: 17, positive unconditional: 251, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 54, unknown conditional: 2, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 2224, Positive cache size: 2157, Positive conditional cache size: 2, Positive unconditional cache size: 2155, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 203.5ms, 46 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 949 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 319, positive: 268, positive conditional: 268, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 319, positive: 268, positive conditional: 0, positive unconditional: 268, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 319, positive: 268, positive conditional: 0, positive unconditional: 268, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 319, positive: 245, positive conditional: 0, positive unconditional: 245, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 2252, Positive cache size: 2180, Positive conditional cache size: 2, Positive unconditional cache size: 2178, Negative cache size: 72, Negative conditional cache size: 0, Negative unconditional cache size: 72, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 316.6ms, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 396 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, positive: 103, positive conditional: 103, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 306, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 306, negative conditional: 0, negative unconditional: 306, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 2267, Positive cache size: 2185, Positive conditional cache size: 2, Positive unconditional cache size: 2183, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.5ms, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 382 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 119, positive: 104, positive conditional: 23, positive unconditional: 81, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 104, positive conditional: 23, positive unconditional: 81, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 1, positive unconditional: 4, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 119, positive: 99, positive conditional: 22, positive unconditional: 77, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 2272, Positive cache size: 2190, Positive conditional cache size: 3, Positive unconditional cache size: 2187, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 120.7ms, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 660 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, positive: 226, positive conditional: 226, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 248, positive: 226, positive conditional: 84, positive unconditional: 142, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 248, positive: 226, positive conditional: 84, positive unconditional: 142, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 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: 248, positive: 223, positive conditional: 81, positive unconditional: 142, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2275, Positive cache size: 2193, Positive conditional cache size: 6, Positive unconditional cache size: 2187, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.1ms, 50 PlacesBefore, 50 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 660 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 288, positive: 266, positive conditional: 266, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 288, positive: 266, positive conditional: 98, positive unconditional: 168, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 288, positive: 266, positive conditional: 98, positive unconditional: 168, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 288, positive: 264, positive conditional: 98, positive unconditional: 166, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2277, Positive cache size: 2195, Positive conditional cache size: 6, Positive unconditional cache size: 2189, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.2ms, 54 PlacesBefore, 54 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 996 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, positive: 402, positive conditional: 402, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 430, positive: 402, positive conditional: 180, positive unconditional: 222, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 430, positive: 402, positive conditional: 180, positive unconditional: 222, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, 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: 430, positive: 399, positive conditional: 178, positive unconditional: 221, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2280, Positive cache size: 2198, Positive conditional cache size: 8, Positive unconditional cache size: 2190, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 118.8ms, 59 PlacesBefore, 59 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1583 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 650, positive: 613, positive conditional: 613, positive unconditional: 0, negative: 37, negative conditional: 37, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 650, positive: 613, positive conditional: 342, positive unconditional: 271, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650, positive: 613, positive conditional: 342, positive unconditional: 271, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 650, positive: 612, positive conditional: 341, positive unconditional: 271, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2281, Positive cache size: 2199, Positive conditional cache size: 9, Positive unconditional cache size: 2190, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.6ms, 64 PlacesBefore, 64 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 994 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1826 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 365, positive: 325, positive conditional: 325, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 365, positive: 325, positive conditional: 203, positive unconditional: 122, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 365, positive: 325, positive conditional: 203, positive unconditional: 122, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 4, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 365, positive: 318, positive conditional: 199, positive unconditional: 119, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2288, Positive cache size: 2206, Positive conditional cache size: 13, Positive unconditional cache size: 2193, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 235.7ms, 68 PlacesBefore, 68 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1774 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, positive: 333, positive conditional: 333, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, positive: 333, positive conditional: 212, positive unconditional: 121, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, positive: 333, positive conditional: 212, positive unconditional: 121, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 369, positive: 333, positive conditional: 212, positive unconditional: 121, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2288, Positive cache size: 2206, Positive conditional cache size: 13, Positive unconditional cache size: 2193, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 121.0ms, 76 PlacesBefore, 76 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 1410 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1496 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 208, positive: 178, positive conditional: 178, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 208, positive: 178, positive conditional: 95, positive unconditional: 83, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 208, positive: 178, positive conditional: 95, positive unconditional: 83, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 208, positive: 178, positive conditional: 95, positive unconditional: 83, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2288, Positive cache size: 2206, Positive conditional cache size: 13, Positive unconditional cache size: 2193, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 92.7ms, 80 PlacesBefore, 80 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1490 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 415, positive: 387, positive conditional: 387, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 415, positive: 387, positive conditional: 301, positive unconditional: 86, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 415, positive: 387, positive conditional: 301, positive unconditional: 86, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 3, positive unconditional: 1, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 415, positive: 383, positive conditional: 298, positive unconditional: 85, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2292, Positive cache size: 2210, Positive conditional cache size: 16, Positive unconditional cache size: 2194, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 192.8ms, 81 PlacesBefore, 81 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 882 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 372, positive: 356, positive conditional: 356, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 372, positive: 356, positive conditional: 278, positive unconditional: 78, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 372, positive: 356, positive conditional: 278, positive unconditional: 78, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 372, positive: 356, positive conditional: 278, positive unconditional: 78, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2294, Positive cache size: 2210, Positive conditional cache size: 16, Positive unconditional cache size: 2194, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, Eliminated conditions: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 144.8ms, 91 PlacesBefore, 90 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 1520 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1004 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 296, positive: 277, positive conditional: 277, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 296, positive: 277, positive conditional: 223, positive unconditional: 54, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 296, positive: 277, positive conditional: 223, positive unconditional: 54, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 9, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 296, positive: 265, positive conditional: 214, positive unconditional: 51, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 12, unknown conditional: 9, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2306, Positive cache size: 2222, Positive conditional cache size: 25, Positive unconditional cache size: 2197, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, Eliminated conditions: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 261.6ms, 84 PlacesBefore, 82 PlacesAfterwards, 85 TransitionsBefore, 84 TransitionsAfterwards, 1472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 904 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 330, positive: 314, positive conditional: 314, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 330, positive: 314, positive conditional: 266, positive unconditional: 48, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 330, positive: 314, positive conditional: 266, positive unconditional: 48, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 10, positive unconditional: 8, 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: 18, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 330, positive: 296, positive conditional: 256, positive unconditional: 40, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 18, unknown conditional: 10, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 2324, Positive cache size: 2240, Positive conditional cache size: 35, Positive unconditional cache size: 2205, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 176.5ms, 85 PlacesBefore, 80 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 846 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 41 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, positive: 41, positive conditional: 32, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 32, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 41, positive: 40, positive conditional: 31, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2325, Positive cache size: 2241, Positive conditional cache size: 36, Positive unconditional cache size: 2205, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, Eliminated conditions: 2 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21642.9ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3563.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6903.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 69 SDtfs, 37 SDslu, 23 SDs, 0 SdLazy, 493 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 628.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 701.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=698occurred in iteration=12, InterpolantAutomatonStates: 83, 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: 48.6ms SsaConstructionTime, 634.2ms SatisfiabilityAnalysisTime, 1240.8ms InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 2197 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...