/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_rmo.opt.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:05:14,402 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:05:14,404 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:05:14,441 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:05:14,441 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:05:14,452 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:05:14,454 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:05:14,456 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:05:14,459 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:05:14,461 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:05:14,464 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:05:14,466 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:05:14,466 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:05:14,468 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:05:14,469 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:05:14,473 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:05:14,473 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:05:14,474 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:05:14,476 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:05:14,478 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:05:14,480 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:05:14,481 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:05:14,482 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:05:14,483 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:05:14,491 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:05:14,491 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:05:14,491 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:05:14,493 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:05:14,494 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:05:14,495 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:05:14,495 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:05:14,497 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:05:14,498 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:05:14,499 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:05:14,500 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:05:14,500 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:05:14,501 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:05:14,501 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:05:14,501 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:05:14,502 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:05:14,503 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:05:14,504 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:05:14,548 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:05:14,548 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:05:14,550 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:05:14,551 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:05:14,551 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:05:14,551 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:05:14,551 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:05:14,552 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:05:14,552 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:05:14,552 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:05:14,553 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:05:14,553 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:05:14,553 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:05:14,554 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:05:14,554 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:05:14,554 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:05:14,555 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:05:14,555 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:05:14,555 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:05:14,555 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:05:14,555 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:05:14,555 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:05:14,556 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:05:14,556 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:05:14,556 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:05:14,556 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:05:14,557 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:05:14,557 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:05:14,557 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-16 11:05:14,557 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:05:14,837 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:05:14,848 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:05:14,852 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:05:14,853 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 11:05:14,853 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 11:05:14,854 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_rmo.opt.i
[2020-10-16 11:05:14,912 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6f563e2cf/bfa151edc45446dbbb6e4a18fd862327/FLAGe15c2a0a1
[2020-10-16 11:05:15,438 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 11:05:15,439 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix002_rmo.opt.i
[2020-10-16 11:05:15,457 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6f563e2cf/bfa151edc45446dbbb6e4a18fd862327/FLAGe15c2a0a1
[2020-10-16 11:05:15,802 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6f563e2cf/bfa151edc45446dbbb6e4a18fd862327
[2020-10-16 11:05:15,810 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:05:15,812 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:05:15,813 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:05:15,813 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:05:15,816 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:05:15,817 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:05:15" (1/1) ...
[2020-10-16 11:05:15,820 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4883ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:15, skipping insertion in model container
[2020-10-16 11:05:15,820 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:05:15" (1/1) ...
[2020-10-16 11:05:15,827 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 11:05:15,880 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:05:16,444 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:05:16,463 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 11:05:16,522 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:05:16,595 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 11:05:16,596 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16 WrapperNode
[2020-10-16 11:05:16,596 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:05:16,597 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:05:16,597 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:05:16,597 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:05:16,606 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
[2020-10-16 11:05:16,627 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
[2020-10-16 11:05:16,659 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:05:16,659 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:05:16,659 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:05:16,659 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:05:16,668 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
[2020-10-16 11:05:16,668 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
[2020-10-16 11:05:16,673 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
[2020-10-16 11:05:16,674 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
[2020-10-16 11:05:16,685 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
[2020-10-16 11:05:16,690 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
[2020-10-16 11:05:16,694 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
[2020-10-16 11:05:16,699 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:05:16,700 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:05:16,700 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:05:16,700 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:05:16,701 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:05:16,757 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:05:16,757 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:05:16,757 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:05:16,758 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:05:16,758 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:05:16,758 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:05:16,758 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:05:16,758 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:05:16,758 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:05:16,759 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:05:16,759 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:05:16,759 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:05:16,759 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:05:16,761 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 11:05:19,001 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:05:19,002 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:05:19,004 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:05:19 BoogieIcfgContainer
[2020-10-16 11:05:19,005 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:05:19,007 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:05:19,007 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:05:19,011 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:05:19,011 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:05:15" (1/3) ...
[2020-10-16 11:05:19,012 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8f6eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:05:19, skipping insertion in model container
[2020-10-16 11:05:19,013 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:16" (2/3) ...
[2020-10-16 11:05:19,013 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8f6eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:05:19, skipping insertion in model container
[2020-10-16 11:05:19,013 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:05:19" (3/3) ...
[2020-10-16 11:05:19,015 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix002_rmo.opt.i
[2020-10-16 11:05:19,030 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:05:19,031 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:05:19,039 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:05:19,040 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:05:19,077 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,077 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,078 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,079 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,079 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,079 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,080 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,080 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,080 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,081 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,081 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,081 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,082 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,082 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,082 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,082 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,082 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,083 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,083 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,083 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,083 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,083 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,084 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,084 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,084 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,084 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,084 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,085 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,085 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,085 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,085 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,085 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,085 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,086 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,086 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,086 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,086 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,086 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,086 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,087 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,088 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,088 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,088 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,088 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,090 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,091 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,092 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,092 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,092 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,092 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,093 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,093 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,093 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,093 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,094 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,094 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,094 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,095 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,095 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,095 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,095 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,095 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,096 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,096 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,096 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,096 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,096 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,098 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,098 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,098 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,098 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,101 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,101 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,101 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,101 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,101 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,102 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,102 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,156 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,156 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,156 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,157 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,157 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,161 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,161 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,161 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,162 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,168 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,169 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,169 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,169 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,169 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,169 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,169 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,170 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,170 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,170 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,170 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,170 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,170 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,170 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,171 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,172 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,172 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,172 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,172 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,172 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,173 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,174 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,174 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,174 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,174 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,174 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,175 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,175 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,175 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,175 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,176 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,176 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,176 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,177 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,177 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,177 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,177 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,178 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,178 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,178 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,178 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,179 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,179 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,179 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,180 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,180 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,180 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,180 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,181 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,181 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,181 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,182 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,182 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,182 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,183 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:19,184 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:05:19,200 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 11:05:19,221 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:05:19,222 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 11:05:19,222 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:05:19,222 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:05:19,222 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:05:19,222 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 11:05:19,222 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:05:19,223 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:05:19,236 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:05:19,239 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 215 flow
[2020-10-16 11:05:19,242 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 215 flow
[2020-10-16 11:05:19,244 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow
[2020-10-16 11:05:19,290 INFO  L129       PetriNetUnfolder]: 2/97 cut-off events.
[2020-10-16 11:05:19,290 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:05:19,297 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. 
[2020-10-16 11:05:19,303 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1814
[2020-10-16 11:05:19,997 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:19,998 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:19,999 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:19,999 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:20,006 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:20,007 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:20,012 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:20,013 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:20,043 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:20,044 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:20,045 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:20,046 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:20,051 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:20,051 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:20,057 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:20,058 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:20,378 WARN  L193               SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:05:20,637 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:20,638 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:20,642 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:20,644 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:20,645 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:20,646 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,018 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:05:21,019 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:21,086 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,087 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:05:21,092 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:21,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,146 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:21,147 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:21,149 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,149 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,152 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,152 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,155 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,156 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,157 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:21,158 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,159 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,160 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,164 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,164 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,277 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,277 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:21,285 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:21,285 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:21,362 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:21,362 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:21,364 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,365 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,366 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,368 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,369 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,370 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,375 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:21,376 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,377 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,378 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,379 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,379 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,466 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:05:21,468 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:21,468 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,504 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:21,505 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:21,506 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,507 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,508 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,508 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,512 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,512 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,515 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:21,515 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,517 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,517 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,518 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,519 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,664 WARN  L193               SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:05:21,784 WARN  L193               SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:05:21,827 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:21,828 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:21,835 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,836 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,837 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,838 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,840 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,841 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:21,843 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:21,844 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,847 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,847 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,849 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,850 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:21,921 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:21,921 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:05:21,923 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:21,924 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,111 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,113 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:22,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:22,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,152 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,152 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,155 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,156 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,157 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,157 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,159 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,159 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,161 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:22,161 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,163 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,164 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,165 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,165 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,244 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,245 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,246 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,246 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,247 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,248 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,249 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:22,249 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,270 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,270 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,272 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,305 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:22,307 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:22,307 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:22,369 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,369 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,370 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,370 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,372 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,372 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:22,373 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:22,374 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:22,385 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:22,385 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,386 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,386 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,387 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,387 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,389 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:22,389 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,442 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,442 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,444 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,444 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,446 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,446 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,447 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,447 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,448 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:22,449 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,450 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,451 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,452 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,479 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,479 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:22,481 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:22,482 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,529 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,529 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:22,531 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:22,531 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,557 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,557 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,559 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,559 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,560 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,560 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,561 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,562 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,563 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:22,564 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,565 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,565 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,566 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,567 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,611 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:22,612 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,617 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,618 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,618 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,619 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,620 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,620 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:22,622 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:22,622 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,623 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,623 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,625 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,625 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:22,656 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,657 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:22,659 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:22,659 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,970 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:22,971 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:22,973 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:22,973 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:22,999 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,000 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,003 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,004 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,005 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,006 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,006 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,007 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,008 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:23,008 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,010 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,010 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,011 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,012 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,106 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:23,107 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,107 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,108 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,109 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,110 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:23,111 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,124 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:23,124 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,125 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,125 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,127 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,127 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:23,129 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:23,129 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:23,181 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,181 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,182 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,183 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,214 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,214 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:23,217 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:23,218 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:23,228 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,228 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,229 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,229 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,231 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,232 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,233 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:23,233 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,265 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,266 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,267 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,267 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,268 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,270 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,271 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:23,272 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,273 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,273 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,274 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,274 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,307 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,308 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:23,309 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:23,309 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,397 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,397 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:23,399 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:23,399 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,424 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,433 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,433 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,435 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,435 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,436 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,436 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,438 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:23,438 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,440 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,441 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,441 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,473 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:23,474 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:23,477 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,477 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,478 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,478 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,479 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,479 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:05:23,481 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:23,481 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,482 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,483 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,483 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,484 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:23,514 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:05:23,514 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-16 11:05:23,516 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:05:23,516 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:24,211 WARN  L193               SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97
[2020-10-16 11:05:24,334 WARN  L193               SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2020-10-16 11:05:24,424 INFO  L132        LiptonReduction]: Checked pairs total: 5577
[2020-10-16 11:05:24,425 INFO  L134        LiptonReduction]: Total number of compositions: 85
[2020-10-16 11:05:24,431 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow
[2020-10-16 11:05:24,487 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 937 states.
[2020-10-16 11:05:24,489 INFO  L276                IsEmpty]: Start isEmpty. Operand 937 states.
[2020-10-16 11:05:24,496 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 11:05:24,496 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:24,497 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:24,497 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:24,502 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:24,503 INFO  L82        PathProgramCache]: Analyzing trace with hash -621540055, now seen corresponding path program 1 times
[2020-10-16 11:05:24,513 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:24,513 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908463352]
[2020-10-16 11:05:24,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:24,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:24,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:24,738 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908463352]
[2020-10-16 11:05:24,739 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:24,739 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:05:24,740 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238570479]
[2020-10-16 11:05:24,744 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:05:24,745 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:24,759 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:05:24,760 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:24,762 INFO  L87              Difference]: Start difference. First operand 937 states. Second operand 3 states.
[2020-10-16 11:05:24,843 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:24,843 INFO  L93              Difference]: Finished difference Result 812 states and 2575 transitions.
[2020-10-16 11:05:24,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:05:24,846 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 11:05:24,846 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:24,869 INFO  L225             Difference]: With dead ends: 812
[2020-10-16 11:05:24,869 INFO  L226             Difference]: Without dead ends: 662
[2020-10-16 11:05:24,871 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:24,896 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2020-10-16 11:05:24,992 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2020-10-16 11:05:24,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 662 states.
[2020-10-16 11:05:25,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions.
[2020-10-16 11:05:25,003 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 7
[2020-10-16 11:05:25,004 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:25,004 INFO  L481      AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions.
[2020-10-16 11:05:25,004 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:05:25,004 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions.
[2020-10-16 11:05:25,005 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 11:05:25,005 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:25,006 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:25,006 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:05:25,006 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:25,006 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:25,006 INFO  L82        PathProgramCache]: Analyzing trace with hash -299474295, now seen corresponding path program 1 times
[2020-10-16 11:05:25,007 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:25,007 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113838405]
[2020-10-16 11:05:25,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:25,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:25,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:25,140 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113838405]
[2020-10-16 11:05:25,141 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:25,141 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:05:25,141 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39710654]
[2020-10-16 11:05:25,143 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:05:25,143 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:25,144 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:05:25,144 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:25,144 INFO  L87              Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states.
[2020-10-16 11:05:25,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:25,156 INFO  L93              Difference]: Finished difference Result 602 states and 1842 transitions.
[2020-10-16 11:05:25,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:05:25,156 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 11:05:25,156 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:25,162 INFO  L225             Difference]: With dead ends: 602
[2020-10-16 11:05:25,163 INFO  L226             Difference]: Without dead ends: 602
[2020-10-16 11:05:25,163 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:25,166 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 602 states.
[2020-10-16 11:05:25,182 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602.
[2020-10-16 11:05:25,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 602 states.
[2020-10-16 11:05:25,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1842 transitions.
[2020-10-16 11:05:25,186 INFO  L78                 Accepts]: Start accepts. Automaton has 602 states and 1842 transitions. Word has length 9
[2020-10-16 11:05:25,187 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:25,187 INFO  L481      AbstractCegarLoop]: Abstraction has 602 states and 1842 transitions.
[2020-10-16 11:05:25,187 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:05:25,187 INFO  L276                IsEmpty]: Start isEmpty. Operand 602 states and 1842 transitions.
[2020-10-16 11:05:25,189 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:05:25,189 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:25,189 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:25,190 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:05:25,190 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:25,190 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:25,190 INFO  L82        PathProgramCache]: Analyzing trace with hash -448103436, now seen corresponding path program 1 times
[2020-10-16 11:05:25,190 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:25,191 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99993296]
[2020-10-16 11:05:25,191 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:25,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:25,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:25,239 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99993296]
[2020-10-16 11:05:25,239 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:25,239 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:05:25,240 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981754356]
[2020-10-16 11:05:25,240 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:05:25,240 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:25,240 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:05:25,241 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:25,241 INFO  L87              Difference]: Start difference. First operand 602 states and 1842 transitions. Second operand 3 states.
[2020-10-16 11:05:25,251 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:25,251 INFO  L93              Difference]: Finished difference Result 566 states and 1716 transitions.
[2020-10-16 11:05:25,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:05:25,252 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 11:05:25,252 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:25,257 INFO  L225             Difference]: With dead ends: 566
[2020-10-16 11:05:25,258 INFO  L226             Difference]: Without dead ends: 566
[2020-10-16 11:05:25,258 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:25,264 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 566 states.
[2020-10-16 11:05:25,279 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566.
[2020-10-16 11:05:25,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 566 states.
[2020-10-16 11:05:25,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1716 transitions.
[2020-10-16 11:05:25,282 INFO  L78                 Accepts]: Start accepts. Automaton has 566 states and 1716 transitions. Word has length 11
[2020-10-16 11:05:25,283 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:25,283 INFO  L481      AbstractCegarLoop]: Abstraction has 566 states and 1716 transitions.
[2020-10-16 11:05:25,283 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:05:25,283 INFO  L276                IsEmpty]: Start isEmpty. Operand 566 states and 1716 transitions.
[2020-10-16 11:05:25,286 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:05:25,286 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:25,286 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:25,286 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:05:25,286 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:25,287 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:25,287 INFO  L82        PathProgramCache]: Analyzing trace with hash -507490775, now seen corresponding path program 1 times
[2020-10-16 11:05:25,287 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:25,287 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592660674]
[2020-10-16 11:05:25,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:25,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:25,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:25,358 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592660674]
[2020-10-16 11:05:25,359 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:25,359 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:05:25,359 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906327033]
[2020-10-16 11:05:25,359 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:05:25,360 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:25,360 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:05:25,360 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:25,360 INFO  L87              Difference]: Start difference. First operand 566 states and 1716 transitions. Second operand 3 states.
[2020-10-16 11:05:25,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:25,375 INFO  L93              Difference]: Finished difference Result 548 states and 1656 transitions.
[2020-10-16 11:05:25,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:05:25,375 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-16 11:05:25,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:25,380 INFO  L225             Difference]: With dead ends: 548
[2020-10-16 11:05:25,380 INFO  L226             Difference]: Without dead ends: 548
[2020-10-16 11:05:25,380 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:25,382 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 548 states.
[2020-10-16 11:05:25,394 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548.
[2020-10-16 11:05:25,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 548 states.
[2020-10-16 11:05:25,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1656 transitions.
[2020-10-16 11:05:25,397 INFO  L78                 Accepts]: Start accepts. Automaton has 548 states and 1656 transitions. Word has length 13
[2020-10-16 11:05:25,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:25,397 INFO  L481      AbstractCegarLoop]: Abstraction has 548 states and 1656 transitions.
[2020-10-16 11:05:25,397 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:05:25,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 548 states and 1656 transitions.
[2020-10-16 11:05:25,399 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:05:25,400 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:25,400 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:25,400 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:05:25,400 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:25,400 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:25,400 INFO  L82        PathProgramCache]: Analyzing trace with hash 1900332105, now seen corresponding path program 1 times
[2020-10-16 11:05:25,401 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:25,401 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731431900]
[2020-10-16 11:05:25,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:25,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:25,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:25,525 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731431900]
[2020-10-16 11:05:25,525 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:25,526 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:05:25,526 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540774398]
[2020-10-16 11:05:25,526 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:25,526 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:25,527 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:25,527 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:25,527 INFO  L87              Difference]: Start difference. First operand 548 states and 1656 transitions. Second operand 4 states.
[2020-10-16 11:05:25,565 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:25,566 INFO  L93              Difference]: Finished difference Result 526 states and 1413 transitions.
[2020-10-16 11:05:25,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:05:25,566 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-16 11:05:25,567 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:25,569 INFO  L225             Difference]: With dead ends: 526
[2020-10-16 11:05:25,569 INFO  L226             Difference]: Without dead ends: 376
[2020-10-16 11:05:25,570 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:05:25,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 376 states.
[2020-10-16 11:05:25,578 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376.
[2020-10-16 11:05:25,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 376 states.
[2020-10-16 11:05:25,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 968 transitions.
[2020-10-16 11:05:25,580 INFO  L78                 Accepts]: Start accepts. Automaton has 376 states and 968 transitions. Word has length 15
[2020-10-16 11:05:25,580 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:25,580 INFO  L481      AbstractCegarLoop]: Abstraction has 376 states and 968 transitions.
[2020-10-16 11:05:25,580 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:25,581 INFO  L276                IsEmpty]: Start isEmpty. Operand 376 states and 968 transitions.
[2020-10-16 11:05:25,582 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:05:25,582 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:25,582 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:25,582 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:05:25,582 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:25,583 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:25,583 INFO  L82        PathProgramCache]: Analyzing trace with hash 525968040, now seen corresponding path program 1 times
[2020-10-16 11:05:25,583 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:25,583 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921713798]
[2020-10-16 11:05:25,583 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:25,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:25,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:25,705 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921713798]
[2020-10-16 11:05:25,705 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:25,705 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:05:25,706 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97955106]
[2020-10-16 11:05:25,706 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:05:25,706 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:25,706 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:05:25,707 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:05:25,707 INFO  L87              Difference]: Start difference. First operand 376 states and 968 transitions. Second operand 5 states.
[2020-10-16 11:05:25,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:25,757 INFO  L93              Difference]: Finished difference Result 318 states and 765 transitions.
[2020-10-16 11:05:25,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:05:25,757 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-16 11:05:25,758 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:25,759 INFO  L225             Difference]: With dead ends: 318
[2020-10-16 11:05:25,759 INFO  L226             Difference]: Without dead ends: 248
[2020-10-16 11:05:25,760 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:05:25,761 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 248 states.
[2020-10-16 11:05:25,765 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248.
[2020-10-16 11:05:25,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 248 states.
[2020-10-16 11:05:25,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 584 transitions.
[2020-10-16 11:05:25,766 INFO  L78                 Accepts]: Start accepts. Automaton has 248 states and 584 transitions. Word has length 17
[2020-10-16 11:05:25,766 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:25,767 INFO  L481      AbstractCegarLoop]: Abstraction has 248 states and 584 transitions.
[2020-10-16 11:05:25,767 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:05:25,767 INFO  L276                IsEmpty]: Start isEmpty. Operand 248 states and 584 transitions.
[2020-10-16 11:05:25,768 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-16 11:05:25,768 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:25,768 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:25,768 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:05:25,768 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:25,768 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:25,769 INFO  L82        PathProgramCache]: Analyzing trace with hash 1751165511, now seen corresponding path program 1 times
[2020-10-16 11:05:25,769 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:25,769 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959940971]
[2020-10-16 11:05:25,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:25,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:25,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:25,890 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959940971]
[2020-10-16 11:05:25,891 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:25,891 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:05:25,891 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322422485]
[2020-10-16 11:05:25,891 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:05:25,892 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:25,892 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:05:25,892 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:05:25,892 INFO  L87              Difference]: Start difference. First operand 248 states and 584 transitions. Second operand 6 states.
[2020-10-16 11:05:25,955 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:25,955 INFO  L93              Difference]: Finished difference Result 229 states and 544 transitions.
[2020-10-16 11:05:25,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:05:25,956 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-16 11:05:25,956 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:25,957 INFO  L225             Difference]: With dead ends: 229
[2020-10-16 11:05:25,957 INFO  L226             Difference]: Without dead ends: 215
[2020-10-16 11:05:25,958 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:05:25,959 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 215 states.
[2020-10-16 11:05:25,962 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215.
[2020-10-16 11:05:25,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 215 states.
[2020-10-16 11:05:25,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions.
[2020-10-16 11:05:25,964 INFO  L78                 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 19
[2020-10-16 11:05:25,964 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:25,964 INFO  L481      AbstractCegarLoop]: Abstraction has 215 states and 518 transitions.
[2020-10-16 11:05:25,964 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:05:25,964 INFO  L276                IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions.
[2020-10-16 11:05:25,965 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:05:25,965 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:25,965 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:25,966 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:05:25,966 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:25,966 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:25,966 INFO  L82        PathProgramCache]: Analyzing trace with hash 567042970, now seen corresponding path program 1 times
[2020-10-16 11:05:25,966 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:25,967 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836658308]
[2020-10-16 11:05:25,967 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:25,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:26,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:26,035 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836658308]
[2020-10-16 11:05:26,035 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:26,035 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:05:26,035 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083904178]
[2020-10-16 11:05:26,036 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:26,036 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:26,036 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:26,036 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:26,037 INFO  L87              Difference]: Start difference. First operand 215 states and 518 transitions. Second operand 4 states.
[2020-10-16 11:05:26,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:26,053 INFO  L93              Difference]: Finished difference Result 277 states and 653 transitions.
[2020-10-16 11:05:26,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:05:26,054 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 22
[2020-10-16 11:05:26,054 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:26,055 INFO  L225             Difference]: With dead ends: 277
[2020-10-16 11:05:26,055 INFO  L226             Difference]: Without dead ends: 107
[2020-10-16 11:05:26,056 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:05:26,056 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2020-10-16 11:05:26,059 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2020-10-16 11:05:26,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2020-10-16 11:05:26,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 222 transitions.
[2020-10-16 11:05:26,060 INFO  L78                 Accepts]: Start accepts. Automaton has 107 states and 222 transitions. Word has length 22
[2020-10-16 11:05:26,060 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:26,060 INFO  L481      AbstractCegarLoop]: Abstraction has 107 states and 222 transitions.
[2020-10-16 11:05:26,060 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:26,060 INFO  L276                IsEmpty]: Start isEmpty. Operand 107 states and 222 transitions.
[2020-10-16 11:05:26,061 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:05:26,061 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:26,061 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:26,062 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:05:26,062 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:26,062 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:26,062 INFO  L82        PathProgramCache]: Analyzing trace with hash -478950482, now seen corresponding path program 2 times
[2020-10-16 11:05:26,062 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:26,063 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410232955]
[2020-10-16 11:05:26,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:26,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:26,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:26,172 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410232955]
[2020-10-16 11:05:26,172 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:26,173 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:05:26,173 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062320332]
[2020-10-16 11:05:26,173 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:26,173 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:26,174 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:26,174 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:26,174 INFO  L87              Difference]: Start difference. First operand 107 states and 222 transitions. Second operand 4 states.
[2020-10-16 11:05:26,191 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:26,191 INFO  L93              Difference]: Finished difference Result 133 states and 270 transitions.
[2020-10-16 11:05:26,191 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:05:26,191 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 22
[2020-10-16 11:05:26,192 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:26,192 INFO  L225             Difference]: With dead ends: 133
[2020-10-16 11:05:26,192 INFO  L226             Difference]: Without dead ends: 51
[2020-10-16 11:05:26,193 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:05:26,193 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2020-10-16 11:05:26,194 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2020-10-16 11:05:26,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2020-10-16 11:05:26,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions.
[2020-10-16 11:05:26,194 INFO  L78                 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22
[2020-10-16 11:05:26,195 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:26,195 INFO  L481      AbstractCegarLoop]: Abstraction has 51 states and 86 transitions.
[2020-10-16 11:05:26,195 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:26,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions.
[2020-10-16 11:05:26,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:05:26,196 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:26,196 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:26,196 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:05:26,196 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:26,196 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:26,196 INFO  L82        PathProgramCache]: Analyzing trace with hash -628070226, now seen corresponding path program 3 times
[2020-10-16 11:05:26,197 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:26,197 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303303612]
[2020-10-16 11:05:26,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:26,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:26,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:26,520 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303303612]
[2020-10-16 11:05:26,521 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:26,521 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:05:26,521 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561987786]
[2020-10-16 11:05:26,521 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:05:26,522 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:26,522 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:05:26,522 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:05:26,522 INFO  L87              Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states.
[2020-10-16 11:05:26,699 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:26,700 INFO  L93              Difference]: Finished difference Result 61 states and 100 transitions.
[2020-10-16 11:05:26,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 11:05:26,700 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2020-10-16 11:05:26,701 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:26,701 INFO  L225             Difference]: With dead ends: 61
[2020-10-16 11:05:26,701 INFO  L226             Difference]: Without dead ends: 33
[2020-10-16 11:05:26,701 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2020-10-16 11:05:26,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2020-10-16 11:05:26,703 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2020-10-16 11:05:26,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2020-10-16 11:05:26,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions.
[2020-10-16 11:05:26,703 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 22
[2020-10-16 11:05:26,703 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:26,703 INFO  L481      AbstractCegarLoop]: Abstraction has 33 states and 44 transitions.
[2020-10-16 11:05:26,704 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:05:26,704 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions.
[2020-10-16 11:05:26,704 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 11:05:26,704 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:26,704 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:26,705 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:05:26,705 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:26,705 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:26,705 INFO  L82        PathProgramCache]: Analyzing trace with hash 515881070, now seen corresponding path program 4 times
[2020-10-16 11:05:26,705 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:26,706 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741635328]
[2020-10-16 11:05:26,706 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:26,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:05:26,772 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:05:26,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:05:26,828 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:05:26,868 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:05:26,868 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:05:26,869 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:05:26,870 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:05:26,885 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1172] [1172] L856-->L863: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In1890984961 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In1890984961 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In1890984961 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In1890984961 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~z$w_buff0_used~0_Out1890984961 0) .cse1) (and .cse2 (= ~z$w_buff0_used~0_In1890984961 ~z$w_buff0_used~0_Out1890984961))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1890984961 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1890984961|) (or (and (= ~z~0_Out1890984961 ~z$w_buff0~0_In1890984961) .cse0 .cse1) (and (or (and .cse3 (= ~z~0_In1890984961 ~z~0_Out1890984961)) (and (= ~z$w_buff1~0_In1890984961 ~z~0_Out1890984961) .cse4 .cse5)) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1890984961 0)) (= ~z$r_buff0_thd0~0_In1890984961 ~z$r_buff0_thd0~0_Out1890984961) (= ~z$r_buff1_thd0~0_Out1890984961 ~z$r_buff1_thd0~0_In1890984961) (or (and (= ~z$w_buff1_used~0_Out1890984961 0) .cse4 .cse5) (and (= ~z$w_buff1_used~0_In1890984961 ~z$w_buff1_used~0_Out1890984961) .cse3)))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1890984961|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1890984961, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1890984961, ~z$w_buff0~0=~z$w_buff0~0_In1890984961, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1890984961, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1890984961, ~z$w_buff1~0=~z$w_buff1~0_In1890984961, ~z~0=~z~0_In1890984961}  OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1890984961, ~z$w_buff0~0=~z$w_buff0~0_In1890984961, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1890984961, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1890984961|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1890984961|, ~z$w_buff1~0=~z$w_buff1~0_In1890984961, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1890984961|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1890984961|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1890984961|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1890984961, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1890984961|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1890984961|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1890984961, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1890984961, ~z~0=~z~0_Out1890984961}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite62, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge
[2020-10-16 11:05:26,894 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,894 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,895 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,895 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,898 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,898 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,898 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,898 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,898 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,898 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,899 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,899 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,899 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,899 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,899 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,899 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,900 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,900 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,902 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,902 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,902 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,902 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,903 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,903 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,903 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,903 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,903 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,903 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,905 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,905 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,905 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,905 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,905 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,906 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,906 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,906 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,906 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,906 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,906 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,907 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,907 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,907 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,907 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,907 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,907 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,908 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,908 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,908 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,908 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,908 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,908 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,909 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,909 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,909 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,909 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,909 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,909 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,909 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,910 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:26,910 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:26,989 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:05:26 BasicIcfg
[2020-10-16 11:05:26,989 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:05:26,992 INFO  L168              Benchmark]: Toolchain (without parser) took 11179.43 ms. Allocated memory was 147.8 MB in the beginning and 394.8 MB in the end (delta: 246.9 MB). Free memory was 100.5 MB in the beginning and 207.3 MB in the end (delta: -106.8 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:26,992 INFO  L168              Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
[2020-10-16 11:05:26,994 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 783.86 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 157.0 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:26,995 INFO  L168              Benchmark]: Boogie Procedure Inliner took 62.17 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 153.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:26,996 INFO  L168              Benchmark]: Boogie Preprocessor took 40.30 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:26,999 INFO  L168              Benchmark]: RCFGBuilder took 2305.00 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 151.2 MB in the beginning and 108.6 MB in the end (delta: 42.6 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:26,999 INFO  L168              Benchmark]: TraceAbstraction took 7982.13 ms. Allocated memory was 244.8 MB in the beginning and 394.8 MB in the end (delta: 149.9 MB). Free memory was 108.6 MB in the beginning and 207.3 MB in the end (delta: -98.7 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:27,010 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 783.86 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 157.0 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 62.17 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 153.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 40.30 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2305.00 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 151.2 MB in the beginning and 108.6 MB in the end (delta: 42.6 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 7982.13 ms. Allocated memory was 244.8 MB in the beginning and 394.8 MB in the end (delta: 149.9 MB). Free memory was 108.6 MB in the beginning and 207.3 MB in the end (delta: -98.7 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1334 VarBasedMoverChecksPositive, 89 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 198 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.1s, 108 PlacesBefore, 37 PlacesAfterwards, 100 TransitionsBefore, 28 TransitionsAfterwards, 1814 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 5577 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p0_EAX = 0;
[L702]               0  int __unbuffered_p0_EBX = 0;
[L704]               0  int __unbuffered_p1_EAX = 0;
[L706]               0  int __unbuffered_p1_EBX = 0;
[L708]               0  int __unbuffered_p2_EAX = 0;
[L710]               0  int __unbuffered_p2_EBX = 0;
[L712]               0  int a = 0;
[L713]               0  _Bool main$tmp_guard0;
[L714]               0  _Bool main$tmp_guard1;
[L716]               0  int x = 0;
[L718]               0  int y = 0;
[L720]               0  int z = 0;
[L721]               0  _Bool z$flush_delayed;
[L722]               0  int z$mem_tmp;
[L723]               0  _Bool z$r_buff0_thd0;
[L724]               0  _Bool z$r_buff0_thd1;
[L725]               0  _Bool z$r_buff0_thd2;
[L726]               0  _Bool z$r_buff0_thd3;
[L727]               0  _Bool z$r_buff1_thd0;
[L728]               0  _Bool z$r_buff1_thd1;
[L729]               0  _Bool z$r_buff1_thd2;
[L730]               0  _Bool z$r_buff1_thd3;
[L731]               0  _Bool z$read_delayed;
[L732]               0  int *z$read_delayed_var;
[L733]               0  int z$w_buff0;
[L734]               0  _Bool z$w_buff0_used;
[L735]               0  int z$w_buff1;
[L736]               0  _Bool z$w_buff1_used;
[L737]               0  _Bool weak$$choice0;
[L738]               0  _Bool weak$$choice2;
[L847]               0  pthread_t t53;
[L848]  FCALL, FORK  0  pthread_create(&t53, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L849]               0  pthread_t t54;
[L850]  FCALL, FORK  0  pthread_create(&t54, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L851]               0  pthread_t t55;
[L852]  FCALL, FORK  0  pthread_create(&t55, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L794]               3  z$w_buff1 = z$w_buff0
[L795]               3  z$w_buff0 = 1
[L796]               3  z$w_buff1_used = z$w_buff0_used
[L797]               3  z$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L799]               3  z$r_buff1_thd0 = z$r_buff0_thd0
[L800]               3  z$r_buff1_thd1 = z$r_buff0_thd1
[L801]               3  z$r_buff1_thd2 = z$r_buff0_thd2
[L802]               3  z$r_buff1_thd3 = z$r_buff0_thd3
[L803]               3  z$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L806]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L807]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L808]               3  z$flush_delayed = weak$$choice2
[L809]               3  z$mem_tmp = z
[L810]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L810]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1
[L810]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L810]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L811]  EXPR         3  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L811]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)
[L811]  EXPR         3  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L811]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L812]  EXPR         3  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L812]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)
[L812]  EXPR         3  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L812]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L813]  EXPR         3  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L813]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)
[L813]  EXPR         3  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L813]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L814]  EXPR         3  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L814]  EXPR         3  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L815]  EXPR         3  weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L815]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L816]  EXPR         3  weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]               3  __unbuffered_p2_EAX = z
[L818]  EXPR         3  z$flush_delayed ? z$mem_tmp : z
[L818]               3  z = z$flush_delayed ? z$mem_tmp : z
[L819]               3  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L822]               3  __unbuffered_p2_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L742]               1  a = 1
[L745]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L748]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L751]               1  __unbuffered_p0_EBX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L756]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L758]               1  return 0;
[L763]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L766]               2  __unbuffered_p1_EAX = y
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L769]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L770]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L771]               2  z$flush_delayed = weak$$choice2
[L772]               2  z$mem_tmp = z
[L773]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L773]               2  z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L774]  EXPR         2  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L774]               2  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L775]  EXPR         2  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L775]               2  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L776]  EXPR         2  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L776]               2  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L777]  EXPR         2  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L777]               2  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L778]  EXPR         2  weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L778]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)
[L778]  EXPR         2  weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L778]               2  z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L779]  EXPR         2  weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L779]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L779]  EXPR         2  weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L779]               2  z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L780]               2  __unbuffered_p1_EBX = z
[L781]  EXPR         2  z$flush_delayed ? z$mem_tmp : z
[L781]               2  z = z$flush_delayed ? z$mem_tmp : z
[L782]               2  z$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L825]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L825]  EXPR         3  z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L825]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L825]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L826]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L826]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L827]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L827]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L828]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L828]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L829]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L829]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L832]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L834]               3  return 0;
[L787]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L789]               2  return 0;
[L854]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L865]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 272 SDtfs, 214 SDslu, 402 SDs, 0 SdLazy, 138 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 15283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...