/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065
[2021-06-11 06:01:32,481 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-06-11 06:01:32,483 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-11 06:01:32,515 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-11 06:01:32,515 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-11 06:01:32,517 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-11 06:01:32,519 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-11 06:01:32,524 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-11 06:01:32,525 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-11 06:01:32,528 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-11 06:01:32,529 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-06-11 06:01:32,530 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-11 06:01:32,530 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-11 06:01:32,531 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-11 06:01:32,532 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-11 06:01:32,533 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-11 06:01:32,535 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-11 06:01:32,536 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-11 06:01:32,538 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-11 06:01:32,542 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-11 06:01:32,543 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-11 06:01:32,543 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-11 06:01:32,544 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-06-11 06:01:32,545 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-11 06:01:32,550 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-11 06:01:32,550 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-11 06:01:32,550 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-11 06:01:32,551 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-11 06:01:32,552 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-11 06:01:32,552 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-11 06:01:32,552 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-11 06:01:32,553 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-11 06:01:32,554 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-11 06:01:32,554 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-11 06:01:32,555 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-11 06:01:32,555 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-11 06:01:32,555 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-11 06:01:32,556 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-11 06:01:32,556 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-11 06:01:32,556 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-11 06:01:32,557 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-06-11 06:01:32,560 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf
[2021-06-11 06:01:32,587 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-06-11 06:01:32,587 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-11 06:01:32,589 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-11 06:01:32,589 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-06-11 06:01:32,590 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-06-11 06:01:32,590 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-11 06:01:32,590 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-06-11 06:01:32,590 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-06-11 06:01:32,590 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-06-11 06:01:32,590 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-06-11 06:01:32,591 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-06-11 06:01:32,591 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-11 06:01:32,591 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-06-11 06:01:32,591 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-06-11 06:01:32,591 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-06-11 06:01:32,591 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-06-11 06:01:32,591 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-06-11 06:01:32,592 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-11 06:01:32,592 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-06-11 06:01:32,592 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-06-11 06:01:32,592 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-06-11 06:01:32,592 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-11 06:01:32,592 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-11 06:01:32,592 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-06-11 06:01:32,593 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-11 06:01:32,593 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-06-11 06:01:32,593 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-11 06:01:32,593 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-06-11 06:01:32,593 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2021-06-11 06:01:32,593 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 06:01:32,837 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-11 06:01:32,855 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-11 06:01:32,857 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-11 06:01:32,858 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-06-11 06:01:32,858 INFO  L275        PluginConnector]: CDTParser initialized
[2021-06-11 06:01:32,859 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i
[2021-06-11 06:01:32,905 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ce617ab/36d6733adb5748d4b5a352ea2fd1e73e/FLAG1793420ae
[2021-06-11 06:01:33,341 INFO  L306              CDTParser]: Found 1 translation units.
[2021-06-11 06:01:33,342 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i
[2021-06-11 06:01:33,354 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ce617ab/36d6733adb5748d4b5a352ea2fd1e73e/FLAG1793420ae
[2021-06-11 06:01:33,685 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ce617ab/36d6733adb5748d4b5a352ea2fd1e73e
[2021-06-11 06:01:33,687 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-11 06:01:33,688 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-11 06:01:33,690 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-11 06:01:33,690 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-11 06:01:33,692 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-11 06:01:33,692 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:01:33" (1/1) ...
[2021-06-11 06:01:33,693 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2844c728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:33, skipping insertion in model container
[2021-06-11 06:01:33,693 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:01:33" (1/1) ...
[2021-06-11 06:01:33,700 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-06-11 06:01:33,725 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-06-11 06:01:33,839 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/mix006_tso.oepc.i[949,962]
[2021-06-11 06:01:34,016 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-11 06:01:34,022 INFO  L203         MainTranslator]: Completed pre-run
[2021-06-11 06:01:34,029 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/mix006_tso.oepc.i[949,962]
[2021-06-11 06:01:34,060 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-11 06:01:34,109 INFO  L208         MainTranslator]: Completed translation
[2021-06-11 06:01:34,110 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34 WrapperNode
[2021-06-11 06:01:34,110 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-11 06:01:34,111 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-11 06:01:34,111 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-11 06:01:34,111 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-11 06:01:34,115 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (1/1) ...
[2021-06-11 06:01:34,142 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (1/1) ...
[2021-06-11 06:01:34,178 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-11 06:01:34,179 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-11 06:01:34,179 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-11 06:01:34,179 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-06-11 06:01:34,185 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (1/1) ...
[2021-06-11 06:01:34,185 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (1/1) ...
[2021-06-11 06:01:34,189 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (1/1) ...
[2021-06-11 06:01:34,189 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (1/1) ...
[2021-06-11 06:01:34,199 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (1/1) ...
[2021-06-11 06:01:34,203 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (1/1) ...
[2021-06-11 06:01:34,207 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (1/1) ...
[2021-06-11 06:01:34,211 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-11 06:01:34,212 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-11 06:01:34,212 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-06-11 06:01:34,212 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-06-11 06:01:34,212 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (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 06:01:34,270 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-06-11 06:01:34,270 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-11 06:01:34,270 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-11 06:01:34,270 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-11 06:01:34,270 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-06-11 06:01:34,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-06-11 06:01:34,270 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-06-11 06:01:34,271 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-06-11 06:01:34,271 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-06-11 06:01:34,271 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-06-11 06:01:34,271 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-11 06:01:34,271 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-11 06:01:34,271 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-11 06:01:34,271 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-11 06:01:34,272 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 06:01:37,147 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-11 06:01:37,147 INFO  L299             CfgBuilder]: Removed 12 assume(true) statements.
[2021-06-11 06:01:37,149 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:01:37 BoogieIcfgContainer
[2021-06-11 06:01:37,149 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-11 06:01:37,150 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-11 06:01:37,150 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-06-11 06:01:37,151 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-06-11 06:01:37,152 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:01:33" (1/3) ...
[2021-06-11 06:01:37,152 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f74b3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:01:37, skipping insertion in model container
[2021-06-11 06:01:37,152 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:01:34" (2/3) ...
[2021-06-11 06:01:37,152 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f74b3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:01:37, skipping insertion in model container
[2021-06-11 06:01:37,152 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:01:37" (3/3) ...
[2021-06-11 06:01:37,153 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix006_tso.oepc.i
[2021-06-11 06:01:37,158 INFO  L149   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-11 06:01:37,161 INFO  L161   ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations.
[2021-06-11 06:01:37,161 INFO  L323   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-11 06:01:37,203 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,203 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,203 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,203 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,203 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,203 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,204 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,204 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,204 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,204 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,204 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,205 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,206 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,206 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,206 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,207 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,207 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,207 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,208 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,208 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,208 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,208 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,208 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,208 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,208 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,209 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,209 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,209 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,209 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,210 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,210 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,210 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,210 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,210 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,210 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,210 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,211 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,212 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,213 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,213 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,213 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,213 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,213 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,213 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,213 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,213 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,214 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,214 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,214 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,215 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,216 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,216 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,216 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,216 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,217 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,218 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,219 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,219 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,219 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,223 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,223 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,223 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,223 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,223 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,224 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,224 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,224 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,224 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,224 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,224 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,225 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,225 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,225 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,226 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,226 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,226 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,226 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,226 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,226 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,227 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,228 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,229 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,229 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,230 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,230 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,230 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,230 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,230 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,230 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,230 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,230 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,231 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,231 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,232 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,233 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,235 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,236 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,236 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,236 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,236 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,236 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,236 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,236 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,236 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,237 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,238 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,238 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,251 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,252 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,253 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,255 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,255 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,255 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,255 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,261 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,264 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,265 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,266 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-11 06:01:37,267 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-11 06:01:37,279 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2021-06-11 06:01:37,292 INFO  L376      AbstractCegarLoop]: Interprodecural is true
[2021-06-11 06:01:37,292 INFO  L377      AbstractCegarLoop]: Hoare is false
[2021-06-11 06:01:37,292 INFO  L378      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-11 06:01:37,292 INFO  L379      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-11 06:01:37,292 INFO  L380      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-11 06:01:37,292 INFO  L381      AbstractCegarLoop]: Difference is false
[2021-06-11 06:01:37,292 INFO  L382      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-11 06:01:37,292 INFO  L386      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-06-11 06:01:37,299 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow
[2021-06-11 06:01:37,327 INFO  L129       PetriNetUnfolder]: 2/116 cut-off events.
[2021-06-11 06:01:37,327 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-11 06:01:37,330 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 126 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 80 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. 
[2021-06-11 06:01:37,330 INFO  L82        GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow
[2021-06-11 06:01:37,333 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow
[2021-06-11 06:01:37,334 INFO  L168   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-11 06:01:37,342 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow
[2021-06-11 06:01:37,345 INFO  L138        LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow
[2021-06-11 06:01:37,346 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow
[2021-06-11 06:01:37,361 INFO  L129       PetriNetUnfolder]: 2/116 cut-off events.
[2021-06-11 06:01:37,361 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-11 06:01:37,361 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 126 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 83 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. 
[2021-06-11 06:01:37,363 INFO  L151        LiptonReduction]: Number of co-enabled transitions 1948
[2021-06-11 06:01:37,450 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,464 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:37,465 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,465 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:37,466 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-11 06:01:37,613 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,614 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,660 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,661 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,672 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,673 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,684 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,685 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,697 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,697 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,709 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,709 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,720 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,721 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,732 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,733 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,747 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,748 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,783 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,784 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:37,855 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,862 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-06-11 06:01:37,863 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:37,883 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:37,886 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,037 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,038 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,100 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,101 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,108 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,110 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,123 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,124 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,149 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,150 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,162 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,163 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,176 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,178 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,191 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,193 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,206 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,207 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,225 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,226 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,240 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,241 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,253 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,255 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,561 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,568 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:38,569 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,569 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:38,570 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-11 06:01:38,679 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,680 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:38,768 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,770 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:38,775 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,776 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:38,777 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-11 06:01:38,836 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,843 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-06-11 06:01:38,843 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:38,844 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:38,845 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,017 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,018 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,190 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,191 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,256 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size
[2021-06-11 06:01:39,258 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,272 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,273 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,432 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,436 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:39,441 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,441 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:39,441 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-11 06:01:39,680 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,682 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,706 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,707 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,721 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,723 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,770 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,771 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,788 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,789 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,828 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,829 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,849 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,850 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,897 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,898 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,935 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,937 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,959 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,961 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,977 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,978 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:39,994 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:39,995 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:40,021 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:40,023 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:40,095 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:40,096 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:40,121 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:40,122 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:40,138 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:40,139 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:40,612 WARN  L205               SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 112
[2021-06-11 06:01:40,758 WARN  L205               SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 110
[2021-06-11 06:01:41,625 WARN  L205               SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 164
[2021-06-11 06:01:41,984 WARN  L205               SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 160
[2021-06-11 06:01:42,003 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,010 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,011 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,012 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50
[2021-06-11 06:01:42,013 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,013 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,014 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term
[2021-06-11 06:01:42,014 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,016 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,017 INFO  L147       QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63
[2021-06-11 06:01:42,018 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,019 INFO  L142       QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size
[2021-06-11 06:01:42,019 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term
[2021-06-11 06:01:42,019 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,020 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,022 INFO  L147       QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50
[2021-06-11 06:01:42,022 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term
[2021-06-11 06:01:42,022 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,023 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,026 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,027 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,028 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50
[2021-06-11 06:01:42,028 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,029 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,030 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term
[2021-06-11 06:01:42,030 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,031 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,032 INFO  L147       QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87
[2021-06-11 06:01:42,032 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,033 INFO  L142       QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size
[2021-06-11 06:01:42,034 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term
[2021-06-11 06:01:42,034 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,035 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,036 INFO  L147       QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50
[2021-06-11 06:01:42,037 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term
[2021-06-11 06:01:42,037 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,038 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,041 INFO  L147       QuantifierPusher]: treesize reduction 343, result has 35.2 percent of original size 186
[2021-06-11 06:01:42,105 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,106 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,277 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,279 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,281 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,281 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:42,284 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-11 06:01:42,333 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,336 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,360 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,361 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,389 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,393 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,438 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,440 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,457 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,458 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,511 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,512 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,514 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,515 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:42,515 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-11 06:01:42,545 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,547 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,571 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,572 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,600 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,602 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,616 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,617 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,699 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,700 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,784 INFO  L142       QuantifierPusher]: treesize reduction 84, result has 91.3 percent of original size
[2021-06-11 06:01:42,805 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,805 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,806 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:42,807 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,807 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,813 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86
[2021-06-11 06:01:42,814 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,815 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,816 INFO  L147       QuantifierPusher]: treesize reduction 36, result has 2.7 percent of original size 1
[2021-06-11 06:01:42,816 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,818 INFO  L142       QuantifierPusher]: treesize reduction 38, result has 69.6 percent of original size
[2021-06-11 06:01:42,819 INFO  L147       QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55
[2021-06-11 06:01:42,825 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,825 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,827 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103
[2021-06-11 06:01:42,829 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,830 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,832 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103
[2021-06-11 06:01:42,833 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,834 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,837 INFO  L147       QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61
[2021-06-11 06:01:42,838 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,839 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,841 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103
[2021-06-11 06:01:42,841 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,843 INFO  L142       QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size
[2021-06-11 06:01:42,844 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term
[2021-06-11 06:01:42,844 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,846 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,847 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term
[2021-06-11 06:01:42,847 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,852 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,853 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term
[2021-06-11 06:01:42,853 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,855 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,858 INFO  L147       QuantifierPusher]: treesize reduction 185, result has 40.1 percent of original size 124
[2021-06-11 06:01:42,858 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:42,874 INFO  L142       QuantifierPusher]: treesize reduction 185, result has 55.3 percent of original size
[2021-06-11 06:01:42,875 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 4, 3, 2, 1] term
[2021-06-11 06:01:42,875 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,876 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,877 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term
[2021-06-11 06:01:42,877 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,878 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,878 INFO  L427       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 2, 1] term
[2021-06-11 06:01:42,878 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,879 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,881 INFO  L147       QuantifierPusher]: treesize reduction 404, result has 24.5 percent of original size 131
[2021-06-11 06:01:42,881 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 06:01:42,882 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,883 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,883 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 06:01:42,883 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,884 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,885 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 06:01:42,885 INFO  L725       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-11 06:01:42,886 INFO  L732       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:42,890 INFO  L147       QuantifierPusher]: treesize reduction 1501, result has 18.0 percent of original size 330
[2021-06-11 06:01:43,074 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,077 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:43,135 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,137 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:43,196 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,198 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:43,273 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,277 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:43,348 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,369 INFO  L147       QuantifierPusher]: treesize reduction 152, result has 25.9 percent of original size 53
[2021-06-11 06:01:43,639 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,640 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:43,642 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,642 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:43,643 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-11 06:01:43,867 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,871 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:43,874 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,875 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:43,875 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,875 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12
[2021-06-11 06:01:43,876 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:43,876 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:43,876 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,882 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:43,883 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,883 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31
[2021-06-11 06:01:43,884 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32
[2021-06-11 06:01:43,884 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:43,884 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:43,885 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34
[2021-06-11 06:01:43,886 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39
[2021-06-11 06:01:44,022 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:44,026 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:44,158 WARN  L205               SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 101
[2021-06-11 06:01:44,362 WARN  L205               SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 101
[2021-06-11 06:01:44,464 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:44,468 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:44,469 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:44,469 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:44,470 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-11 06:01:44,972 WARN  L205               SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 152
[2021-06-11 06:01:45,201 WARN  L205               SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 148
[2021-06-11 06:01:45,668 WARN  L205               SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 152
[2021-06-11 06:01:45,890 WARN  L205               SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 148
[2021-06-11 06:01:45,902 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:45,909 WARN  L159       QuantifierPusher]: Ignoring assumption.
[2021-06-11 06:01:45,909 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:45,910 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:45,916 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-11 06:01:45,922 INFO  L163        LiptonReduction]: Checked pairs total: 6618
[2021-06-11 06:01:45,922 INFO  L165        LiptonReduction]: Total number of compositions: 106
[2021-06-11 06:01:45,924 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8591
[2021-06-11 06:01:45,929 INFO  L129       PetriNetUnfolder]: 0/7 cut-off events.
[2021-06-11 06:01:45,929 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-11 06:01:45,930 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-06-11 06:01:45,930 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2021-06-11 06:01:45,930 INFO  L428      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-11 06:01:45,933 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-11 06:01:45,933 INFO  L82        PathProgramCache]: Analyzing trace with hash -2067076804, now seen corresponding path program 1 times
[2021-06-11 06:01:45,938 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-11 06:01:45,938 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250595304]
[2021-06-11 06:01:45,938 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-11 06:01:46,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-11 06:01:46,085 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:46,086 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:46,090 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 06:01:46,091 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250595304]
[2021-06-11 06:01:46,091 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-11 06:01:46,091 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-06-11 06:01:46,091 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741891538]
[2021-06-11 06:01:46,096 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-11 06:01:46,096 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-11 06:01:46,103 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-11 06:01:46,104 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-11 06:01:46,105 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 190 out of 225
[2021-06-11 06:01:46,107 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-11 06:01:46,107 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-11 06:01:46,108 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 225
[2021-06-11 06:01:46,108 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-11 06:01:46,186 INFO  L129       PetriNetUnfolder]: 69/181 cut-off events.
[2021-06-11 06:01:46,186 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-11 06:01:46,187 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 309 conditions, 181 events. 69/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 889 event pairs, 41 based on Foata normal form. 30/183 useless extension candidates. Maximal degree in co-relation 299. Up to 97 conditions per place. 
[2021-06-11 06:01:46,188 INFO  L132   encePairwiseOnDemand]: 220/225 looper letters, 10 selfloop transitions, 2 changer transitions 0/32 dead transitions.
[2021-06-11 06:01:46,188 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 97 flow
[2021-06-11 06:01:46,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-11 06:01:46,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-06-11 06:01:46,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions.
[2021-06-11 06:01:46,198 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8696296296296296
[2021-06-11 06:01:46,198 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 587 transitions.
[2021-06-11 06:01:46,198 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions.
[2021-06-11 06:01:46,199 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-11 06:01:46,201 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions.
[2021-06-11 06:01:46,204 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 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 06:01:46,209 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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 06:01:46,210 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 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 06:01:46,211 INFO  L185             Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 587 transitions.
[2021-06-11 06:01:46,212 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 97 flow
[2021-06-11 06:01:46,213 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-06-11 06:01:46,214 INFO  L241             Difference]: Finished difference. Result has 37 places, 28 transitions, 66 flow
[2021-06-11 06:01:46,215 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=28}
[2021-06-11 06:01:46,215 INFO  L343   CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places.
[2021-06-11 06:01:46,215 INFO  L168   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-11 06:01:46,216 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 66 flow
[2021-06-11 06:01:46,216 INFO  L138        LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 66 flow
[2021-06-11 06:01:46,217 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 66 flow
[2021-06-11 06:01:46,221 INFO  L129       PetriNetUnfolder]: 0/28 cut-off events.
[2021-06-11 06:01:46,221 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-11 06:01:46,221 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 38 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 53 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. 
[2021-06-11 06:01:46,221 INFO  L151        LiptonReduction]: Number of co-enabled transitions 398
[2021-06-11 06:01:46,979 WARN  L205               SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 193
[2021-06-11 06:01:47,574 WARN  L205               SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 190
[2021-06-11 06:01:48,918 WARN  L205               SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 317 DAG size of output: 272
[2021-06-11 06:01:49,497 WARN  L205               SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 269
[2021-06-11 06:01:49,502 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:49,511 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:50,236 WARN  L205               SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 207
[2021-06-11 06:01:50,556 WARN  L205               SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 205
[2021-06-11 06:01:52,403 WARN  L205               SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 337 DAG size of output: 291
[2021-06-11 06:01:53,234 WARN  L205               SmtUtils]: Spent 829.00 ms on a formula simplification that was a NOOP. DAG size: 287
[2021-06-11 06:01:53,826 INFO  L163        LiptonReduction]: Checked pairs total: 892
[2021-06-11 06:01:53,826 INFO  L165        LiptonReduction]: Total number of compositions: 2
[2021-06-11 06:01:53,827 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7612
[2021-06-11 06:01:53,827 INFO  L480      AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 64 flow
[2021-06-11 06:01:53,828 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-11 06:01:53,828 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-06-11 06:01:53,828 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2021-06-11 06:01:53,828 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-06-11 06:01:53,828 INFO  L428      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-11 06:01:53,828 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-11 06:01:53,828 INFO  L82        PathProgramCache]: Analyzing trace with hash 2109140902, now seen corresponding path program 1 times
[2021-06-11 06:01:53,828 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-11 06:01:53,828 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436490144]
[2021-06-11 06:01:53,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-11 06:01:53,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-11 06:01:53,905 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:53,905 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:53,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 06:01:53,907 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436490144]
[2021-06-11 06:01:53,907 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-11 06:01:53,907 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-06-11 06:01:53,907 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548285141]
[2021-06-11 06:01:53,908 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-11 06:01:53,908 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-11 06:01:53,909 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-11 06:01:53,909 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-11 06:01:53,910 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 194 out of 227
[2021-06-11 06:01:53,910 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 64 flow. Second operand  has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 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 06:01:53,910 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-11 06:01:53,910 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 227
[2021-06-11 06:01:53,910 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-11 06:01:53,946 INFO  L129       PetriNetUnfolder]: 13/65 cut-off events.
[2021-06-11 06:01:53,946 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-11 06:01:53,946 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 105 conditions, 65 events. 13/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 224 event pairs, 5 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 96. Up to 25 conditions per place. 
[2021-06-11 06:01:53,946 INFO  L132   encePairwiseOnDemand]: 224/227 looper letters, 6 selfloop transitions, 2 changer transitions 1/28 dead transitions.
[2021-06-11 06:01:53,946 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 82 flow
[2021-06-11 06:01:53,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-11 06:01:53,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-06-11 06:01:53,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions.
[2021-06-11 06:01:53,949 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8678414096916299
[2021-06-11 06:01:53,949 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 591 transitions.
[2021-06-11 06:01:53,949 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions.
[2021-06-11 06:01:53,949 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-11 06:01:53,949 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions.
[2021-06-11 06:01:53,950 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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 06:01:53,951 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-11 06:01:53,951 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-11 06:01:53,951 INFO  L185             Difference]: Start difference. First operand has 36 places, 27 transitions, 64 flow. Second operand 3 states and 591 transitions.
[2021-06-11 06:01:53,951 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 82 flow
[2021-06-11 06:01:53,952 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-06-11 06:01:53,952 INFO  L241             Difference]: Finished difference. Result has 35 places, 25 transitions, 60 flow
[2021-06-11 06:01:53,952 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=25}
[2021-06-11 06:01:53,953 INFO  L343   CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places.
[2021-06-11 06:01:53,953 INFO  L168   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-11 06:01:53,953 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 60 flow
[2021-06-11 06:01:53,954 INFO  L138        LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 60 flow
[2021-06-11 06:01:53,954 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 60 flow
[2021-06-11 06:01:53,959 INFO  L129       PetriNetUnfolder]: 0/25 cut-off events.
[2021-06-11 06:01:53,959 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-11 06:01:53,960 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 35 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. 
[2021-06-11 06:01:53,960 INFO  L151        LiptonReduction]: Number of co-enabled transitions 322
[2021-06-11 06:01:54,028 INFO  L163        LiptonReduction]: Checked pairs total: 410
[2021-06-11 06:01:54,028 INFO  L165        LiptonReduction]: Total number of compositions: 0
[2021-06-11 06:01:54,028 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75
[2021-06-11 06:01:54,029 INFO  L480      AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow
[2021-06-11 06:01:54,029 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 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 06:01:54,029 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-06-11 06:01:54,029 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-11 06:01:54,030 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-06-11 06:01:54,030 INFO  L428      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-11 06:01:54,030 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-11 06:01:54,030 INFO  L82        PathProgramCache]: Analyzing trace with hash -340020661, now seen corresponding path program 1 times
[2021-06-11 06:01:54,030 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-11 06:01:54,030 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389080452]
[2021-06-11 06:01:54,030 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-11 06:01:54,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-11 06:01:54,098 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:54,099 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:54,101 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 06:01:54,101 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389080452]
[2021-06-11 06:01:54,101 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-11 06:01:54,101 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-06-11 06:01:54,101 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376460870]
[2021-06-11 06:01:54,101 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-11 06:01:54,101 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-11 06:01:54,102 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-11 06:01:54,102 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-11 06:01:54,103 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 200 out of 227
[2021-06-11 06:01:54,103 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand  has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 06:01:54,103 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-11 06:01:54,103 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 227
[2021-06-11 06:01:54,103 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-11 06:01:54,120 INFO  L129       PetriNetUnfolder]: 1/30 cut-off events.
[2021-06-11 06:01:54,121 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-11 06:01:54,121 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 38. Up to 5 conditions per place. 
[2021-06-11 06:01:54,121 INFO  L132   encePairwiseOnDemand]: 224/227 looper letters, 1 selfloop transitions, 2 changer transitions 3/26 dead transitions.
[2021-06-11 06:01:54,121 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 72 flow
[2021-06-11 06:01:54,122 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-11 06:01:54,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-06-11 06:01:54,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 606 transitions.
[2021-06-11 06:01:54,123 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8898678414096917
[2021-06-11 06:01:54,123 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 606 transitions.
[2021-06-11 06:01:54,123 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 606 transitions.
[2021-06-11 06:01:54,123 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-11 06:01:54,123 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 606 transitions.
[2021-06-11 06:01:54,124 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 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 06:01:54,125 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-11 06:01:54,125 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-11 06:01:54,126 INFO  L185             Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 3 states and 606 transitions.
[2021-06-11 06:01:54,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 72 flow
[2021-06-11 06:01:54,126 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-06-11 06:01:54,126 INFO  L241             Difference]: Finished difference. Result has 35 places, 23 transitions, 60 flow
[2021-06-11 06:01:54,126 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=23}
[2021-06-11 06:01:54,127 INFO  L343   CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places.
[2021-06-11 06:01:54,127 INFO  L168   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-11 06:01:54,127 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 60 flow
[2021-06-11 06:01:54,127 INFO  L138        LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 60 flow
[2021-06-11 06:01:54,127 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow
[2021-06-11 06:01:54,130 INFO  L129       PetriNetUnfolder]: 0/23 cut-off events.
[2021-06-11 06:01:54,130 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-11 06:01:54,131 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2021-06-11 06:01:54,131 INFO  L151        LiptonReduction]: Number of co-enabled transitions 262
[2021-06-11 06:01:54,265 INFO  L163        LiptonReduction]: Checked pairs total: 326
[2021-06-11 06:01:54,265 INFO  L165        LiptonReduction]: Total number of compositions: 0
[2021-06-11 06:01:54,265 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 138
[2021-06-11 06:01:54,266 INFO  L480      AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 60 flow
[2021-06-11 06:01:54,266 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 06:01:54,266 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-06-11 06:01:54,266 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-11 06:01:54,266 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-06-11 06:01:54,267 INFO  L428      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-11 06:01:54,267 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-11 06:01:54,267 INFO  L82        PathProgramCache]: Analyzing trace with hash -404793465, now seen corresponding path program 1 times
[2021-06-11 06:01:54,267 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-11 06:01:54,267 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566670192]
[2021-06-11 06:01:54,267 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-11 06:01:54,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-11 06:01:54,365 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:54,366 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:54,368 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 06:01:54,369 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566670192]
[2021-06-11 06:01:54,370 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-11 06:01:54,370 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-06-11 06:01:54,370 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935866640]
[2021-06-11 06:01:54,370 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-11 06:01:54,371 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-11 06:01:54,371 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-11 06:01:54,371 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-11 06:01:54,372 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 200 out of 227
[2021-06-11 06:01:54,373 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 60 flow. Second operand  has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 06:01:54,373 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-11 06:01:54,373 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 227
[2021-06-11 06:01:54,373 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-11 06:01:54,387 INFO  L129       PetriNetUnfolder]: 0/23 cut-off events.
[2021-06-11 06:01:54,387 INFO  L130       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2021-06-11 06:01:54,387 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 40 conditions, 23 events. 0/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2021-06-11 06:01:54,387 INFO  L132   encePairwiseOnDemand]: 224/227 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions.
[2021-06-11 06:01:54,387 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 66 flow
[2021-06-11 06:01:54,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-11 06:01:54,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-06-11 06:01:54,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions.
[2021-06-11 06:01:54,389 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8869309838472834
[2021-06-11 06:01:54,389 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 604 transitions.
[2021-06-11 06:01:54,389 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 604 transitions.
[2021-06-11 06:01:54,390 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-11 06:01:54,390 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 604 transitions.
[2021-06-11 06:01:54,391 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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 06:01:54,391 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-11 06:01:54,392 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-11 06:01:54,392 INFO  L185             Difference]: Start difference. First operand has 33 places, 23 transitions, 60 flow. Second operand 3 states and 604 transitions.
[2021-06-11 06:01:54,392 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 66 flow
[2021-06-11 06:01:54,392 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-06-11 06:01:54,393 INFO  L241             Difference]: Finished difference. Result has 34 places, 23 transitions, 64 flow
[2021-06-11 06:01:54,393 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=23}
[2021-06-11 06:01:54,393 INFO  L343   CegarLoopForPetriNet]: 40 programPoint places, -6 predicate places.
[2021-06-11 06:01:54,393 INFO  L168   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-11 06:01:54,393 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 64 flow
[2021-06-11 06:01:54,393 INFO  L138        LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 64 flow
[2021-06-11 06:01:54,394 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 64 flow
[2021-06-11 06:01:54,397 INFO  L129       PetriNetUnfolder]: 0/23 cut-off events.
[2021-06-11 06:01:54,398 INFO  L130       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2021-06-11 06:01:54,398 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 39 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2021-06-11 06:01:54,398 INFO  L151        LiptonReduction]: Number of co-enabled transitions 258
[2021-06-11 06:01:54,453 INFO  L163        LiptonReduction]: Checked pairs total: 296
[2021-06-11 06:01:54,453 INFO  L165        LiptonReduction]: Total number of compositions: 0
[2021-06-11 06:01:54,453 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60
[2021-06-11 06:01:54,454 INFO  L480      AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 64 flow
[2021-06-11 06:01:54,454 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 06:01:54,454 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-06-11 06:01:54,454 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-11 06:01:54,454 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-06-11 06:01:54,454 INFO  L428      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-11 06:01:54,454 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-11 06:01:54,455 INFO  L82        PathProgramCache]: Analyzing trace with hash 2075548097, now seen corresponding path program 1 times
[2021-06-11 06:01:54,455 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-11 06:01:54,455 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244611597]
[2021-06-11 06:01:54,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-11 06:01:54,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-11 06:01:54,529 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:54,529 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:54,532 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:54,532 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-11 06:01:54,541 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:54,542 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:54,542 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 06:01:54,542 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244611597]
[2021-06-11 06:01:54,542 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-11 06:01:54,542 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-06-11 06:01:54,542 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573128563]
[2021-06-11 06:01:54,542 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-06-11 06:01:54,543 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-11 06:01:54,543 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-06-11 06:01:54,543 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-06-11 06:01:54,544 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 227
[2021-06-11 06:01:54,544 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 64 flow. Second operand  has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 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 06:01:54,544 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-11 06:01:54,544 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 227
[2021-06-11 06:01:54,544 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-11 06:01:54,590 INFO  L129       PetriNetUnfolder]: 28/81 cut-off events.
[2021-06-11 06:01:54,590 INFO  L130       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2021-06-11 06:01:54,592 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 168 conditions, 81 events. 28/81 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 289 event pairs, 12 based on Foata normal form. 8/88 useless extension candidates. Maximal degree in co-relation 157. Up to 45 conditions per place. 
[2021-06-11 06:01:54,592 INFO  L132   encePairwiseOnDemand]: 221/227 looper letters, 5 selfloop transitions, 4 changer transitions 7/33 dead transitions.
[2021-06-11 06:01:54,592 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 116 flow
[2021-06-11 06:01:54,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-06-11 06:01:54,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-06-11 06:01:54,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 953 transitions.
[2021-06-11 06:01:54,594 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.839647577092511
[2021-06-11 06:01:54,594 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 953 transitions.
[2021-06-11 06:01:54,594 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 953 transitions.
[2021-06-11 06:01:54,595 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-11 06:01:54,595 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 953 transitions.
[2021-06-11 06:01:54,596 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 0 states have call successors, (0), 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 06:01:54,598 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 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 06:01:54,598 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 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 06:01:54,598 INFO  L185             Difference]: Start difference. First operand has 34 places, 23 transitions, 64 flow. Second operand 5 states and 953 transitions.
[2021-06-11 06:01:54,598 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 116 flow
[2021-06-11 06:01:54,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-06-11 06:01:54,600 INFO  L241             Difference]: Finished difference. Result has 39 places, 26 transitions, 96 flow
[2021-06-11 06:01:54,600 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=26}
[2021-06-11 06:01:54,600 INFO  L343   CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places.
[2021-06-11 06:01:54,600 INFO  L168   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-11 06:01:54,600 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 96 flow
[2021-06-11 06:01:54,600 INFO  L138        LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 96 flow
[2021-06-11 06:01:54,600 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 96 flow
[2021-06-11 06:01:54,609 INFO  L129       PetriNetUnfolder]: 23/66 cut-off events.
[2021-06-11 06:01:54,610 INFO  L130       PetriNetUnfolder]: For 34/34 co-relation queries the response was YES.
[2021-06-11 06:01:54,611 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 173 conditions, 66 events. 23/66 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 212 event pairs, 11 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 161. Up to 38 conditions per place. 
[2021-06-11 06:01:54,614 INFO  L151        LiptonReduction]: Number of co-enabled transitions 292
[2021-06-11 06:01:54,717 INFO  L163        LiptonReduction]: Checked pairs total: 290
[2021-06-11 06:01:54,718 INFO  L165        LiptonReduction]: Total number of compositions: 0
[2021-06-11 06:01:54,718 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118
[2021-06-11 06:01:54,718 INFO  L480      AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 96 flow
[2021-06-11 06:01:54,719 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 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 06:01:54,719 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-06-11 06:01:54,719 INFO  L263   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-11 06:01:54,719 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2021-06-11 06:01:54,719 INFO  L428      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-11 06:01:54,719 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-11 06:01:54,719 INFO  L82        PathProgramCache]: Analyzing trace with hash 1332580062, now seen corresponding path program 1 times
[2021-06-11 06:01:54,719 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-11 06:01:54,719 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930268932]
[2021-06-11 06:01:54,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-11 06:01:54,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-11 06:01:54,852 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:54,852 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:54,854 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:54,855 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:54,858 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:54,859 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-11 06:01:54,863 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:54,864 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:54,864 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 06:01:54,864 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930268932]
[2021-06-11 06:01:54,864 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-11 06:01:54,865 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-06-11 06:01:54,865 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677799274]
[2021-06-11 06:01:54,865 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-06-11 06:01:54,865 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-11 06:01:54,865 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-06-11 06:01:54,867 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-06-11 06:01:54,867 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 227
[2021-06-11 06:01:54,868 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 96 flow. Second operand  has 5 states, 5 states have (on average 187.8) internal successors, (939), 5 states have internal predecessors, (939), 0 states have call successors, (0), 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 06:01:54,868 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-11 06:01:54,868 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 227
[2021-06-11 06:01:54,868 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-11 06:01:54,990 INFO  L129       PetriNetUnfolder]: 16/59 cut-off events.
[2021-06-11 06:01:54,990 INFO  L130       PetriNetUnfolder]: For 42/50 co-relation queries the response was YES.
[2021-06-11 06:01:54,990 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 59 events. 16/59 cut-off events. For 42/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 158 event pairs, 2 based on Foata normal form. 11/69 useless extension candidates. Maximal degree in co-relation 178. Up to 35 conditions per place. 
[2021-06-11 06:01:54,990 INFO  L132   encePairwiseOnDemand]: 221/227 looper letters, 5 selfloop transitions, 7 changer transitions 7/36 dead transitions.
[2021-06-11 06:01:54,991 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 192 flow
[2021-06-11 06:01:54,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-06-11 06:01:54,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-06-11 06:01:54,993 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1143 transitions.
[2021-06-11 06:01:54,993 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8392070484581498
[2021-06-11 06:01:54,993 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1143 transitions.
[2021-06-11 06:01:54,993 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1143 transitions.
[2021-06-11 06:01:54,993 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-11 06:01:54,994 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1143 transitions.
[2021-06-11 06:01:54,995 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 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 06:01:54,996 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 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 06:01:54,997 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 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 06:01:54,997 INFO  L185             Difference]: Start difference. First operand has 37 places, 26 transitions, 96 flow. Second operand 6 states and 1143 transitions.
[2021-06-11 06:01:54,997 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 192 flow
[2021-06-11 06:01:54,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places.
[2021-06-11 06:01:54,998 INFO  L241             Difference]: Finished difference. Result has 43 places, 29 transitions, 146 flow
[2021-06-11 06:01:54,998 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=29}
[2021-06-11 06:01:54,999 INFO  L343   CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places.
[2021-06-11 06:01:54,999 INFO  L168   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-11 06:01:54,999 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 29 transitions, 146 flow
[2021-06-11 06:01:54,999 INFO  L138        LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 29 transitions, 146 flow
[2021-06-11 06:01:54,999 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 146 flow
[2021-06-11 06:01:55,005 INFO  L129       PetriNetUnfolder]: 11/46 cut-off events.
[2021-06-11 06:01:55,005 INFO  L130       PetriNetUnfolder]: For 58/63 co-relation queries the response was YES.
[2021-06-11 06:01:55,005 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 157 conditions, 46 events. 11/46 cut-off events. For 58/63 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 2 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 142. Up to 23 conditions per place. 
[2021-06-11 06:01:55,006 INFO  L151        LiptonReduction]: Number of co-enabled transitions 292
[2021-06-11 06:01:55,007 INFO  L163        LiptonReduction]: Checked pairs total: 339
[2021-06-11 06:01:55,007 INFO  L165        LiptonReduction]: Total number of compositions: 0
[2021-06-11 06:01:55,007 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8
[2021-06-11 06:01:55,008 INFO  L480      AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 146 flow
[2021-06-11 06:01:55,008 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 5 states have (on average 187.8) internal successors, (939), 5 states have internal predecessors, (939), 0 states have call successors, (0), 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 06:01:55,008 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-06-11 06:01:55,008 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 06:01:55,008 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2021-06-11 06:01:55,008 INFO  L428      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-11 06:01:55,008 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-11 06:01:55,009 INFO  L82        PathProgramCache]: Analyzing trace with hash -318962496, now seen corresponding path program 1 times
[2021-06-11 06:01:55,009 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-11 06:01:55,009 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4177617]
[2021-06-11 06:01:55,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-11 06:01:55,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-11 06:01:55,104 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:55,104 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-11 06:01:55,113 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 86.1 percent of original size
[2021-06-11 06:01:55,117 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62
[2021-06-11 06:01:55,146 INFO  L142       QuantifierPusher]: treesize reduction 38, result has 73.8 percent of original size
[2021-06-11 06:01:55,147 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 107
[2021-06-11 06:01:55,213 INFO  L142       QuantifierPusher]: treesize reduction 8, result has 65.2 percent of original size
[2021-06-11 06:01:55,215 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15
[2021-06-11 06:01:55,226 INFO  L142       QuantifierPusher]: treesize reduction 8, result has 50.0 percent of original size
[2021-06-11 06:01:55,226 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8
[2021-06-11 06:01:55,234 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 06:01:55,234 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4177617]
[2021-06-11 06:01:55,234 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-11 06:01:55,234 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-06-11 06:01:55,234 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906259933]
[2021-06-11 06:01:55,235 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-11 06:01:55,235 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-11 06:01:55,235 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-11 06:01:55,235 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-11 06:01:55,236 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 227
[2021-06-11 06:01:55,237 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 146 flow. Second operand  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 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 06:01:55,237 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-11 06:01:55,237 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 227
[2021-06-11 06:01:55,237 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-11 06:01:55,459 INFO  L129       PetriNetUnfolder]: 30/93 cut-off events.
[2021-06-11 06:01:55,459 INFO  L130       PetriNetUnfolder]: For 171/190 co-relation queries the response was YES.
[2021-06-11 06:01:55,459 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 346 conditions, 93 events. 30/93 cut-off events. For 171/190 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 318 event pairs, 4 based on Foata normal form. 7/98 useless extension candidates. Maximal degree in co-relation 329. Up to 44 conditions per place. 
[2021-06-11 06:01:55,459 INFO  L132   encePairwiseOnDemand]: 220/227 looper letters, 6 selfloop transitions, 12 changer transitions 1/41 dead transitions.
[2021-06-11 06:01:55,460 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 234 flow
[2021-06-11 06:01:55,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-11 06:01:55,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-06-11 06:01:55,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1505 transitions.
[2021-06-11 06:01:55,463 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.7366617719040627
[2021-06-11 06:01:55,463 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1505 transitions.
[2021-06-11 06:01:55,463 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1505 transitions.
[2021-06-11 06:01:55,465 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-11 06:01:55,465 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1505 transitions.
[2021-06-11 06:01:55,467 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 167.22222222222223) internal successors, (1505), 9 states have internal predecessors, (1505), 0 states have call successors, (0), 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 06:01:55,469 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 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 06:01:55,469 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 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 06:01:55,470 INFO  L185             Difference]: Start difference. First operand has 41 places, 29 transitions, 146 flow. Second operand 9 states and 1505 transitions.
[2021-06-11 06:01:55,470 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 234 flow
[2021-06-11 06:01:55,474 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 188 flow, removed 19 selfloop flow, removed 4 redundant places.
[2021-06-11 06:01:55,474 INFO  L241             Difference]: Finished difference. Result has 48 places, 37 transitions, 176 flow
[2021-06-11 06:01:55,474 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=37}
[2021-06-11 06:01:55,475 INFO  L343   CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places.
[2021-06-11 06:01:55,475 INFO  L168   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-11 06:01:55,475 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 176 flow
[2021-06-11 06:01:55,475 INFO  L138        LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 176 flow
[2021-06-11 06:01:55,475 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 176 flow
[2021-06-11 06:01:55,484 INFO  L129       PetriNetUnfolder]: 23/78 cut-off events.
[2021-06-11 06:01:55,484 INFO  L130       PetriNetUnfolder]: For 63/71 co-relation queries the response was YES.
[2021-06-11 06:01:55,484 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 228 conditions, 78 events. 23/78 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 264 event pairs, 3 based on Foata normal form. 3/78 useless extension candidates. Maximal degree in co-relation 212. Up to 36 conditions per place. 
[2021-06-11 06:01:55,485 INFO  L151        LiptonReduction]: Number of co-enabled transitions 290
[2021-06-11 06:01:55,511 INFO  L163        LiptonReduction]: Checked pairs total: 270
[2021-06-11 06:01:55,511 INFO  L165        LiptonReduction]: Total number of compositions: 0
[2021-06-11 06:01:55,511 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36
[2021-06-11 06:01:55,512 INFO  L480      AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 176 flow
[2021-06-11 06:01:55,512 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 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 06:01:55,512 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-06-11 06:01:55,512 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 06:01:55,512 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2021-06-11 06:01:55,513 INFO  L428      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-11 06:01:55,513 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-11 06:01:55,513 INFO  L82        PathProgramCache]: Analyzing trace with hash -2049590820, now seen corresponding path program 2 times
[2021-06-11 06:01:55,513 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-11 06:01:55,513 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490468779]
[2021-06-11 06:01:55,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-11 06:01:55,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-11 06:01:55,662 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:55,662 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:55,665 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:55,665 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:55,668 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:55,668 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-11 06:01:55,672 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:55,672 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-11 06:01:55,677 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-11 06:01:55,677 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-11 06:01:55,678 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 06:01:55,678 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490468779]
[2021-06-11 06:01:55,678 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-11 06:01:55,678 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-06-11 06:01:55,678 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391952738]
[2021-06-11 06:01:55,679 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-11 06:01:55,679 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-11 06:01:55,679 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-11 06:01:55,679 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-06-11 06:01:55,680 INFO  L508   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 227
[2021-06-11 06:01:55,681 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 176 flow. Second operand  has 6 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 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 06:01:55,681 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-11 06:01:55,681 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 227
[2021-06-11 06:01:55,681 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-11 06:01:55,733 INFO  L129       PetriNetUnfolder]: 14/59 cut-off events.
[2021-06-11 06:01:55,733 INFO  L130       PetriNetUnfolder]: For 74/114 co-relation queries the response was YES.
[2021-06-11 06:01:55,733 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 208 conditions, 59 events. 14/59 cut-off events. For 74/114 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 154 event pairs, 0 based on Foata normal form. 26/82 useless extension candidates. Maximal degree in co-relation 193. Up to 33 conditions per place. 
[2021-06-11 06:01:55,734 INFO  L132   encePairwiseOnDemand]: 221/227 looper letters, 2 selfloop transitions, 10 changer transitions 5/34 dead transitions.
[2021-06-11 06:01:55,734 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 34 transitions, 201 flow
[2021-06-11 06:01:55,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-06-11 06:01:55,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-06-11 06:01:55,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1327 transitions.
[2021-06-11 06:01:55,736 INFO  L553   CegarLoopForPetriNet]: DFA transition density 0.8351164254247955
[2021-06-11 06:01:55,736 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1327 transitions.
[2021-06-11 06:01:55,736 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1327 transitions.
[2021-06-11 06:01:55,737 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-11 06:01:55,737 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1327 transitions.
[2021-06-11 06:01:55,739 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 189.57142857142858) internal successors, (1327), 7 states have internal predecessors, (1327), 0 states have call successors, (0), 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 06:01:55,740 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 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 06:01:55,741 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 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 06:01:55,741 INFO  L185             Difference]: Start difference. First operand has 47 places, 37 transitions, 176 flow. Second operand 7 states and 1327 transitions.
[2021-06-11 06:01:55,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 34 transitions, 201 flow
[2021-06-11 06:01:55,742 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 169 flow, removed 9 selfloop flow, removed 8 redundant places.
[2021-06-11 06:01:55,742 INFO  L241             Difference]: Finished difference. Result has 47 places, 29 transitions, 140 flow
[2021-06-11 06:01:55,742 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=29}
[2021-06-11 06:01:55,742 INFO  L343   CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places.
[2021-06-11 06:01:55,742 INFO  L168   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-11 06:01:55,743 INFO  L137   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 29 transitions, 140 flow
[2021-06-11 06:01:55,743 INFO  L138        LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 29 transitions, 140 flow
[2021-06-11 06:01:55,743 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 44 places, 29 transitions, 140 flow
[2021-06-11 06:01:55,748 INFO  L129       PetriNetUnfolder]: 6/36 cut-off events.
[2021-06-11 06:01:55,748 INFO  L130       PetriNetUnfolder]: For 41/47 co-relation queries the response was YES.
[2021-06-11 06:01:55,748 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 36 events. 6/36 cut-off events. For 41/47 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 88. Up to 13 conditions per place. 
[2021-06-11 06:01:55,748 INFO  L151        LiptonReduction]: Number of co-enabled transitions 220
[2021-06-11 06:01:55,764 INFO  L163        LiptonReduction]: Checked pairs total: 275
[2021-06-11 06:01:55,764 INFO  L165        LiptonReduction]: Total number of compositions: 0
[2021-06-11 06:01:55,764 INFO  L199   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22
[2021-06-11 06:01:55,764 INFO  L480      AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 140 flow
[2021-06-11 06:01:55,765 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 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 06:01:55,765 INFO  L255   CegarLoopForPetriNet]: Found error trace
[2021-06-11 06:01:55,765 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 06:01:55,765 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2021-06-11 06:01:55,765 INFO  L428      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-11 06:01:55,765 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-11 06:01:55,765 INFO  L82        PathProgramCache]: Analyzing trace with hash -921974952, now seen corresponding path program 1 times
[2021-06-11 06:01:55,765 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-11 06:01:55,765 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133376134]
[2021-06-11 06:01:55,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-11 06:01:55,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-11 06:01:55,832 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-11 06:01:55,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-11 06:01:55,938 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-11 06:01:55,978 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-11 06:01:55,978 INFO  L634         BasicCegarLoop]: Counterexample might be feasible
[2021-06-11 06:01:55,978 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2021-06-11 06:01:56,083 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:01:56 BasicIcfg
[2021-06-11 06:01:56,083 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-11 06:01:56,083 INFO  L168              Benchmark]: Toolchain (without parser) took 22395.53 ms. Allocated memory was 360.7 MB in the beginning and 801.1 MB in the end (delta: 440.4 MB). Free memory was 323.0 MB in the beginning and 411.9 MB in the end (delta: -88.9 MB). Peak memory consumption was 351.9 MB. Max. memory is 16.0 GB.
[2021-06-11 06:01:56,083 INFO  L168              Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 360.7 MB. Free memory was 341.4 MB in the beginning and 341.2 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-11 06:01:56,084 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 420.40 ms. Allocated memory is still 360.7 MB. Free memory was 322.9 MB in the beginning and 314.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB.
[2021-06-11 06:01:56,084 INFO  L168              Benchmark]: Boogie Procedure Inliner took 67.37 ms. Allocated memory is still 360.7 MB. Free memory was 314.1 MB in the beginning and 309.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-06-11 06:01:56,084 INFO  L168              Benchmark]: Boogie Preprocessor took 32.51 ms. Allocated memory is still 360.7 MB. Free memory was 309.9 MB in the beginning and 305.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-06-11 06:01:56,087 INFO  L168              Benchmark]: RCFGBuilder took 2937.27 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 305.7 MB in the beginning and 247.5 MB in the end (delta: 58.3 MB). Peak memory consumption was 160.0 MB. Max. memory is 16.0 GB.
[2021-06-11 06:01:56,087 INFO  L168              Benchmark]: TraceAbstraction took 18933.16 ms. Allocated memory was 434.1 MB in the beginning and 801.1 MB in the end (delta: 367.0 MB). Free memory was 247.5 MB in the beginning and 411.9 MB in the end (delta: -164.5 MB). Peak memory consumption was 201.5 MB. Max. memory is 16.0 GB.
[2021-06-11 06:01:56,092 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.09 ms. Allocated memory is still 360.7 MB. Free memory was 341.4 MB in the beginning and 341.2 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 420.40 ms. Allocated memory is still 360.7 MB. Free memory was 322.9 MB in the beginning and 314.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 67.37 ms. Allocated memory is still 360.7 MB. Free memory was 314.1 MB in the beginning and 309.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 32.51 ms. Allocated memory is still 360.7 MB. Free memory was 309.9 MB in the beginning and 305.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2937.27 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 305.7 MB in the beginning and 247.5 MB in the end (delta: 58.3 MB). Peak memory consumption was 160.0 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 18933.16 ms. Allocated memory was 434.1 MB in the beginning and 801.1 MB in the end (delta: 367.0 MB). Free memory was 247.5 MB in the beginning and 411.9 MB in the end (delta: -164.5 MB). Peak memory consumption was 201.5 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 8577.2ms, 124 PlacesBefore, 40 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 1948 CoEnabledTransitionPairs, 8 FixpointIterations, 54 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 6618 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2846, positive: 2640, positive conditional: 0, positive unconditional: 2640, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1353, positive: 1301, positive conditional: 0, positive unconditional: 1301, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1353, positive: 1301, positive conditional: 0, positive unconditional: 1301, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1353, positive: 1266, positive conditional: 0, positive unconditional: 1266, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1237, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 1170, negative conditional: 0, negative unconditional: 1170, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 2846, positive: 1339, positive conditional: 0, positive unconditional: 1339, negative: 154, negative conditional: 0, negative unconditional: 154, unknown: 1353, unknown conditional: 0, unknown unconditional: 1353] , Statistics on independence cache: Total cache size (in pairs): 2364, Positive cache size: 2312, Positive conditional cache size: 0, Positive unconditional cache size: 2312, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 7610.0ms, 37 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 892 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 200, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 630, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 630, negative conditional: 0, negative unconditional: 630, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 200, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 62, unknown conditional: 0, unknown unconditional: 62] , Statistics on independence cache: Total cache size (in pairs): 2444, Positive cache size: 2375, Positive conditional cache size: 0, Positive unconditional cache size: 2375, Negative cache size: 69, Negative conditional cache size: 0, Negative unconditional cache size: 69
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 74.8ms, 35 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 410 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 66, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 49, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2446, Positive cache size: 2375, Positive conditional cache size: 0, Positive unconditional cache size: 2375, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 138.4ms, 35 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 326 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 9, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 132, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 83, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2455, Positive cache size: 2379, Positive conditional cache size: 0, Positive unconditional cache size: 2379, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 59.7ms, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 296 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 12, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 53, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 90, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 2467, Positive cache size: 2389, Positive conditional cache size: 0, Positive unconditional cache size: 2389, Negative cache size: 78, Negative conditional cache size: 0, Negative unconditional cache size: 78
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 117.5ms, 39 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 290 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 102, negative conditional: 0, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 69, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 2472, Positive cache size: 2390, Positive conditional cache size: 0, Positive unconditional cache size: 2390, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 8.3ms, 43 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 85, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 85, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2472, Positive cache size: 2390, Positive conditional cache size: 0, Positive unconditional cache size: 2390, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 36.4ms, 48 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 29, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2475, Positive cache size: 2392, Positive conditional cache size: 0, Positive unconditional cache size: 2392, Negative cache size: 83, Negative conditional cache size: 0, Negative unconditional cache size: 83
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 21.2ms, 47 PlacesBefore, 44 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 275 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 137, positive: 116, positive conditional: 0, positive unconditional: 116, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 137, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2478, Positive cache size: 2393, Positive conditional cache size: 0, Positive unconditional cache size: 2393, Negative cache size: 85, Negative conditional cache size: 0, Negative unconditional cache size: 85
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p1_EAX = 0;
[L713]               0  int __unbuffered_p1_EBX = 0;
[L715]               0  int __unbuffered_p2_EAX = 0;
[L717]               0  int __unbuffered_p2_EBX = 0;
[L718]               0  _Bool main$tmp_guard0;
[L719]               0  _Bool main$tmp_guard1;
[L721]               0  int x = 0;
[L722]               0  _Bool x$flush_delayed;
[L723]               0  int x$mem_tmp;
[L724]               0  _Bool x$r_buff0_thd0;
[L725]               0  _Bool x$r_buff0_thd1;
[L726]               0  _Bool x$r_buff0_thd2;
[L727]               0  _Bool x$r_buff0_thd3;
[L728]               0  _Bool x$r_buff1_thd0;
[L729]               0  _Bool x$r_buff1_thd1;
[L730]               0  _Bool x$r_buff1_thd2;
[L731]               0  _Bool x$r_buff1_thd3;
[L732]               0  _Bool x$read_delayed;
[L733]               0  int *x$read_delayed_var;
[L734]               0  int x$w_buff0;
[L735]               0  _Bool x$w_buff0_used;
[L736]               0  int x$w_buff1;
[L737]               0  _Bool x$w_buff1_used;
[L739]               0  int y = 0;
[L740]               0  _Bool y$flush_delayed;
[L741]               0  int y$mem_tmp;
[L742]               0  _Bool y$r_buff0_thd0;
[L743]               0  _Bool y$r_buff0_thd1;
[L744]               0  _Bool y$r_buff0_thd2;
[L745]               0  _Bool y$r_buff0_thd3;
[L746]               0  _Bool y$r_buff1_thd0;
[L747]               0  _Bool y$r_buff1_thd1;
[L748]               0  _Bool y$r_buff1_thd2;
[L749]               0  _Bool y$r_buff1_thd3;
[L750]               0  _Bool y$read_delayed;
[L751]               0  int *y$read_delayed_var;
[L752]               0  int y$w_buff0;
[L753]               0  _Bool y$w_buff0_used;
[L754]               0  int y$w_buff1;
[L755]               0  _Bool y$w_buff1_used;
[L757]               0  int z = 0;
[L758]               0  _Bool weak$$choice0;
[L759]               0  _Bool weak$$choice2;
[L899]               0  pthread_t t171;
[L900]  FCALL, FORK  0  pthread_create(&t171, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L901]               0  pthread_t t172;
[L902]  FCALL, FORK  0  pthread_create(&t172, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L903]               0  pthread_t t173;
[L904]  FCALL, FORK  0  pthread_create(&t173, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L841]               3  y$w_buff1 = y$w_buff0
[L842]               3  y$w_buff0 = 1
[L843]               3  y$w_buff1_used = y$w_buff0_used
[L844]               3  y$w_buff0_used = (_Bool)1
[L18]   COND FALSE   3  !(!expression)
[L846]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L847]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L848]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L849]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L850]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L853]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L854]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L855]               3  y$flush_delayed = weak$$choice2
[L856]               3  y$mem_tmp = y
[L857]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L857]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1
[L857]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L857]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L858]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L858]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L859]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L859]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L860]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L860]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L861]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L861]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L862]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L862]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L863]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L863]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L864]               3  __unbuffered_p2_EAX = y
[L865]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L865]               3  y = y$flush_delayed ? y$mem_tmp : y
[L866]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L869]               3  __unbuffered_p2_EBX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L783]               2  x$w_buff1 = x$w_buff0
[L784]               2  x$w_buff0 = 2
[L785]               2  x$w_buff1_used = x$w_buff0_used
[L786]               2  x$w_buff0_used = (_Bool)1
[L18]   COND FALSE   2  !(!expression)
[L788]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L789]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L790]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L791]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L792]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L795]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L796]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L797]               2  x$flush_delayed = weak$$choice2
[L798]               2  x$mem_tmp = x
[L799]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L799]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1
[L799]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L799]               2  x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L800]  EXPR         2  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L800]               2  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L801]  EXPR         2  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L801]               2  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L802]  EXPR         2  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L802]               2  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L803]  EXPR         2  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L803]               2  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L804]  EXPR         2  weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L804]               2  x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L805]  EXPR         2  weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L805]               2  x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L806]               2  __unbuffered_p1_EAX = x
[L807]  EXPR         2  x$flush_delayed ? x$mem_tmp : x
[L807]               2  x = x$flush_delayed ? x$mem_tmp : x
[L808]               2  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L811]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L812]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L813]               2  y$flush_delayed = weak$$choice2
[L814]               2  y$mem_tmp = y
[L815]  EXPR         2  !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L815]               2  y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L816]  EXPR         2  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L816]               2  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L817]  EXPR         2  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L817]               2  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L818]  EXPR         2  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L818]               2  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L819]  EXPR         2  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L819]               2  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L820]  EXPR         2  weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L820]               2  y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L821]  EXPR         2  weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L821]               2  y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L822]               2  __unbuffered_p1_EBX = y
[L823]  EXPR         2  y$flush_delayed ? y$mem_tmp : y
[L823]               2  y = y$flush_delayed ? y$mem_tmp : y
[L824]               2  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L872]  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)
[L872]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L872]  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)
[L872]               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)
[L873]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L873]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L874]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L874]               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
[L875]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L875]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L876]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L876]               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
[L877]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L877]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L878]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L878]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L879]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L879]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L880]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L880]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L881]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L881]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L763]               1  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L766]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L769]  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)
[L769]  EXPR         1  x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L769]  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)
[L769]               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)
[L770]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L770]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L771]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L771]               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
[L772]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L772]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L773]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L773]               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
[L776]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L778]               1  return 0;
[L827]  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)
[L827]               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)
[L828]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L828]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L829]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L829]               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
[L830]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L830]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L831]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L831]               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
[L834]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L836]               2  return 0;
[L884]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L886]               3  return 0;
[L906]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L910]  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)
[L910]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L910]  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)
[L910]               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)
[L911]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L911]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L912]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L912]               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
[L913]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L913]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L914]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L914]               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
[L915]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L915]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L915]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L915]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L916]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L916]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L917]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L917]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L918]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L918]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L919]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L919]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L922]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L923]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L924]               0  x$flush_delayed = weak$$choice2
[L925]               0  x$mem_tmp = x
[L926]  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)
[L926]               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)
[L927]  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))
[L927]               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))
[L928]  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))
[L928]               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))
[L929]  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))
[L929]               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))
[L930]  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))
[L930]               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))
[L931]  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))
[L931]               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))
[L932]  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))
[L932]               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))
[L933]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L934]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L934]               0  x = x$flush_delayed ? x$mem_tmp : x
[L935]               0  x$flush_delayed = (_Bool)0
[L18]   COND TRUE    0  !expression
[L18]                0  reach_error()
        VAL             [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 118 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18689.7ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 698.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8635.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 25 SDtfs, 10 SDslu, 13 SDs, 0 SdLazy, 156 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 231.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 278.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=7, InterpolantAutomatonStates: 39, 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: 29.1ms SsaConstructionTime, 457.9ms SatisfiabilityAnalysisTime, 514.5ms InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...