/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/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.opt.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 12:48:04,558 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 12:48:04,561 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 12:48:04,612 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 12:48:04,613 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 12:48:04,614 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 12:48:04,615 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 12:48:04,617 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 12:48:04,619 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 12:48:04,620 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 12:48:04,621 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 12:48:04,622 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 12:48:04,622 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 12:48:04,623 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 12:48:04,624 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 12:48:04,626 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 12:48:04,626 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 12:48:04,627 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 12:48:04,629 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 12:48:04,632 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 12:48:04,633 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 12:48:04,635 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 12:48:04,636 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 12:48:04,637 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 12:48:04,641 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 12:48:04,642 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 12:48:04,642 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 12:48:04,643 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 12:48:04,643 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 12:48:04,644 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 12:48:04,645 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 12:48:04,645 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 12:48:04,646 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 12:48:04,647 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 12:48:04,648 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 12:48:04,648 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 12:48:04,649 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 12:48:04,649 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 12:48:04,650 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 12:48:04,651 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 12:48:04,651 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 12:48:04,652 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf
[2020-10-16 12:48:04,676 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 12:48:04,676 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 12:48:04,678 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 12:48:04,678 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 12:48:04,678 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 12:48:04,678 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 12:48:04,679 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 12:48:04,679 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 12:48:04,679 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 12:48:04,679 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 12:48:04,679 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 12:48:04,679 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 12:48:04,680 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 12:48:04,680 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 12:48:04,680 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 12:48:04,680 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 12:48:04,680 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 12:48:04,681 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 12:48:04,681 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 12:48:04,681 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 12:48:04,681 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 12:48:04,682 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 12:48:04,682 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 12:48:04,682 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 12:48:04,682 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 12:48:04,682 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 12:48:04,683 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 12:48:04,683 INFO  L138        SettingsManager]:  * Override the interpolant automaton setting of the refinement strategy=true
[2020-10-16 12:48:04,683 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 12:48:04,683 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 12:48:04,683 INFO  L138        SettingsManager]:  * Interpolant automaton=MCR
[2020-10-16 12:48:05,006 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 12:48:05,023 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 12:48:05,028 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 12:48:05,029 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 12:48:05,030 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 12:48:05,032 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.opt.i
[2020-10-16 12:48:05,108 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/df10d1fad/d3f4c9faa1a5472497ad7b1f30f804ba/FLAG7994c3cef
[2020-10-16 12:48:05,638 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 12:48:05,639 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix005_tso.opt.i
[2020-10-16 12:48:05,658 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/df10d1fad/d3f4c9faa1a5472497ad7b1f30f804ba/FLAG7994c3cef
[2020-10-16 12:48:05,969 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/df10d1fad/d3f4c9faa1a5472497ad7b1f30f804ba
[2020-10-16 12:48:05,977 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 12:48:05,979 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 12:48:05,980 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 12:48:05,981 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 12:48:05,984 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 12:48:05,986 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:48:05" (1/1) ...
[2020-10-16 12:48:05,991 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4874472d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:05, skipping insertion in model container
[2020-10-16 12:48:05,991 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:48:05" (1/1) ...
[2020-10-16 12:48:06,000 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 12:48:06,073 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 12:48:06,626 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:48:06,643 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 12:48:06,735 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:48:06,816 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 12:48:06,816 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06 WrapperNode
[2020-10-16 12:48:06,816 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 12:48:06,817 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 12:48:06,818 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 12:48:06,818 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 12:48:06,827 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (1/1) ...
[2020-10-16 12:48:06,857 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (1/1) ...
[2020-10-16 12:48:06,909 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 12:48:06,910 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 12:48:06,910 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 12:48:06,910 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 12:48:06,920 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (1/1) ...
[2020-10-16 12:48:06,920 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (1/1) ...
[2020-10-16 12:48:06,926 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (1/1) ...
[2020-10-16 12:48:06,926 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (1/1) ...
[2020-10-16 12:48:06,939 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (1/1) ...
[2020-10-16 12:48:06,944 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (1/1) ...
[2020-10-16 12:48:06,949 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (1/1) ...
[2020-10-16 12:48:06,955 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 12:48:06,956 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 12:48:06,956 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 12:48:06,956 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 12:48:06,957 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (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 12:48:07,036 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 12:48:07,036 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 12:48:07,037 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 12:48:07,038 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 12:48:07,038 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 12:48:07,038 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 12:48:07,039 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 12:48:07,039 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 12:48:07,039 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 12:48:07,039 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 12:48:07,040 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 12:48:07,040 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 12:48:07,040 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 12:48:07,040 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 12:48:07,040 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 12:48:07,043 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 12:48:09,560 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 12:48:09,560 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 12:48:09,563 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:48:09 BoogieIcfgContainer
[2020-10-16 12:48:09,563 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 12:48:09,565 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 12:48:09,565 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 12:48:09,569 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 12:48:09,569 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:48:05" (1/3) ...
[2020-10-16 12:48:09,570 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15380ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:48:09, skipping insertion in model container
[2020-10-16 12:48:09,571 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:48:06" (2/3) ...
[2020-10-16 12:48:09,571 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15380ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:48:09, skipping insertion in model container
[2020-10-16 12:48:09,571 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:48:09" (3/3) ...
[2020-10-16 12:48:09,573 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix005_tso.opt.i
[2020-10-16 12:48:09,587 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 12:48:09,587 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 12:48:09,597 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 12:48:09,598 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 12:48:09,635 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,635 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,635 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,636 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,636 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,636 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,637 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,637 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,637 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,637 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,637 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,638 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,638 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,638 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,638 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,639 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,639 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,639 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,639 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,639 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,640 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,640 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,640 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,640 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,640 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,641 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,641 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,641 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,641 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,641 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,642 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,642 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,642 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,642 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,642 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,642 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,643 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,643 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,643 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,643 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,643 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,644 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,644 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,644 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,644 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,644 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,645 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,645 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,645 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,645 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,645 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,645 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,646 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,646 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,648 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,648 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,649 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,649 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,649 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,649 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,650 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,650 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,650 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,650 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,651 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,651 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,651 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,651 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,651 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,651 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,652 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,652 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,652 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,652 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,652 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,652 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,652 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,653 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,653 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,653 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,653 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,653 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,654 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,654 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,654 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,654 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,654 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,654 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,655 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,655 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,655 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,655 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,655 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,656 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,656 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,656 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,656 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,656 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,656 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,657 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,657 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,657 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,659 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,659 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,660 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,660 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,660 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,660 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,660 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,661 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,661 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,665 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,666 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,666 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,666 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,666 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,667 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,667 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,667 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,667 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,667 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,668 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,668 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,668 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,668 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,668 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,669 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,669 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,669 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,669 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,669 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,670 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,670 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,670 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,670 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,671 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,671 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,671 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,675 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,675 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,675 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,676 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,676 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,676 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,676 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,677 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,677 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,677 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,677 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,677 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,677 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,678 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,678 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,678 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,678 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,678 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,679 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,679 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,679 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,679 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,679 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,680 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,680 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,680 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,680 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,680 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,681 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,681 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,681 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,681 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,681 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,682 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,682 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,689 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,689 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,689 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,689 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,691 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,691 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,691 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,692 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:48:09,693 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 12:48:09,708 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 12:48:09,731 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 12:48:09,732 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 12:48:09,732 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 12:48:09,732 INFO  L380      AbstractCegarLoop]: Backedges is MCR
[2020-10-16 12:48:09,732 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 12:48:09,732 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 12:48:09,732 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 12:48:09,733 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 12:48:09,748 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 12:48:09,749 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow
[2020-10-16 12:48:09,752 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow
[2020-10-16 12:48:09,754 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow
[2020-10-16 12:48:09,851 INFO  L129       PetriNetUnfolder]: 2/108 cut-off events.
[2020-10-16 12:48:09,851 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 12:48:09,859 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. 
[2020-10-16 12:48:09,863 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2446
[2020-10-16 12:48:10,508 WARN  L193               SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44
[2020-10-16 12:48:11,242 WARN  L193               SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61
[2020-10-16 12:48:11,400 WARN  L193               SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 56
[2020-10-16 12:48:12,813 WARN  L193               SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99
[2020-10-16 12:48:12,995 WARN  L193               SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 97
[2020-10-16 12:48:13,012 INFO  L132        LiptonReduction]: Checked pairs total: 7121
[2020-10-16 12:48:13,012 INFO  L134        LiptonReduction]: Total number of compositions: 92
[2020-10-16 12:48:13,022 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow
[2020-10-16 12:48:13,271 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states.
[2020-10-16 12:48:13,277 INFO  L276                IsEmpty]: Start isEmpty. Operand 3002 states.
[2020-10-16 12:48:13,286 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 12:48:13,286 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:13,287 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:48:13,287 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:13,294 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:13,294 INFO  L82        PathProgramCache]: Analyzing trace with hash 987745277, now seen corresponding path program 1 times
[2020-10-16 12:48:13,322 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:13,323 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661024883]
[2020-10-16 12:48:13,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:13,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:13,647 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 12:48:13,647 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661024883]
[2020-10-16 12:48:13,649 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:13,649 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:48:13,649 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1554698717]
[2020-10-16 12:48:13,651 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:13,655 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:13,674 INFO  L258    McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions.
[2020-10-16 12:48:13,676 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:13,684 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 12:48:13,686 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:48:13,687 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:13,709 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:48:13,710 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:48:13,712 INFO  L87              Difference]: Start difference. First operand 3002 states. Second operand 3 states.
[2020-10-16 12:48:13,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:13,847 INFO  L93              Difference]: Finished difference Result 2602 states and 10064 transitions.
[2020-10-16 12:48:13,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:48:13,850 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 12:48:13,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:13,894 INFO  L225             Difference]: With dead ends: 2602
[2020-10-16 12:48:13,895 INFO  L226             Difference]: Without dead ends: 2122
[2020-10-16 12:48:13,896 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 12:48:13,935 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2122 states.
[2020-10-16 12:48:14,040 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122.
[2020-10-16 12:48:14,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2122 states.
[2020-10-16 12:48:14,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions.
[2020-10-16 12:48:14,061 INFO  L78                 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9
[2020-10-16 12:48:14,062 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:14,063 INFO  L481      AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions.
[2020-10-16 12:48:14,063 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:48:14,063 INFO  L276                IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions.
[2020-10-16 12:48:14,065 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 12:48:14,066 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:14,066 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:48:14,066 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 12:48:14,066 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:14,067 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:14,067 INFO  L82        PathProgramCache]: Analyzing trace with hash 35482932, now seen corresponding path program 1 times
[2020-10-16 12:48:14,071 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:14,071 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918823254]
[2020-10-16 12:48:14,071 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:14,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:14,174 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 12:48:14,175 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918823254]
[2020-10-16 12:48:14,175 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:14,175 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:48:14,175 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205214163]
[2020-10-16 12:48:14,176 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:14,177 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:14,179 INFO  L258    McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions.
[2020-10-16 12:48:14,180 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:14,180 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 12:48:14,182 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:48:14,182 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:14,182 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:48:14,182 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:48:14,183 INFO  L87              Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states.
[2020-10-16 12:48:14,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:14,212 INFO  L93              Difference]: Finished difference Result 1930 states and 7248 transitions.
[2020-10-16 12:48:14,213 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:48:14,213 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 12:48:14,213 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:14,232 INFO  L225             Difference]: With dead ends: 1930
[2020-10-16 12:48:14,232 INFO  L226             Difference]: Without dead ends: 1930
[2020-10-16 12:48:14,233 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 12:48:14,247 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1930 states.
[2020-10-16 12:48:14,309 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930.
[2020-10-16 12:48:14,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1930 states.
[2020-10-16 12:48:14,325 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7248 transitions.
[2020-10-16 12:48:14,325 INFO  L78                 Accepts]: Start accepts. Automaton has 1930 states and 7248 transitions. Word has length 11
[2020-10-16 12:48:14,326 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:14,326 INFO  L481      AbstractCegarLoop]: Abstraction has 1930 states and 7248 transitions.
[2020-10-16 12:48:14,326 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:48:14,326 INFO  L276                IsEmpty]: Start isEmpty. Operand 1930 states and 7248 transitions.
[2020-10-16 12:48:14,330 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 12:48:14,330 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:14,330 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:48:14,330 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 12:48:14,331 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:14,331 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:14,331 INFO  L82        PathProgramCache]: Analyzing trace with hash -261685378, now seen corresponding path program 1 times
[2020-10-16 12:48:14,335 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:14,335 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34397453]
[2020-10-16 12:48:14,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:14,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:14,398 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 12:48:14,398 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34397453]
[2020-10-16 12:48:14,398 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:14,399 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:48:14,399 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5596675]
[2020-10-16 12:48:14,399 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:14,401 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:14,405 INFO  L258    McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions.
[2020-10-16 12:48:14,405 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:14,472 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 12:48:14,472 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:48:14,473 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:14,473 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:48:14,473 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:48:14,473 INFO  L87              Difference]: Start difference. First operand 1930 states and 7248 transitions. Second operand 3 states.
[2020-10-16 12:48:14,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:14,504 INFO  L93              Difference]: Finished difference Result 1894 states and 7086 transitions.
[2020-10-16 12:48:14,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:48:14,504 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-16 12:48:14,505 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:14,524 INFO  L225             Difference]: With dead ends: 1894
[2020-10-16 12:48:14,525 INFO  L226             Difference]: Without dead ends: 1894
[2020-10-16 12:48:14,525 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 12:48:14,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1894 states.
[2020-10-16 12:48:14,594 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894.
[2020-10-16 12:48:14,594 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1894 states.
[2020-10-16 12:48:14,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 7086 transitions.
[2020-10-16 12:48:14,607 INFO  L78                 Accepts]: Start accepts. Automaton has 1894 states and 7086 transitions. Word has length 13
[2020-10-16 12:48:14,607 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:14,607 INFO  L481      AbstractCegarLoop]: Abstraction has 1894 states and 7086 transitions.
[2020-10-16 12:48:14,607 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:48:14,607 INFO  L276                IsEmpty]: Start isEmpty. Operand 1894 states and 7086 transitions.
[2020-10-16 12:48:14,610 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 12:48:14,610 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:14,610 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:48:14,610 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 12:48:14,611 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:14,611 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:14,611 INFO  L82        PathProgramCache]: Analyzing trace with hash 2068421009, now seen corresponding path program 1 times
[2020-10-16 12:48:14,612 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:14,613 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770114172]
[2020-10-16 12:48:14,613 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:14,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:14,659 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 12:48:14,660 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770114172]
[2020-10-16 12:48:14,660 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:14,660 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:48:14,660 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [212543976]
[2020-10-16 12:48:14,660 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:14,662 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:14,667 INFO  L258    McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions.
[2020-10-16 12:48:14,667 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:14,783 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 12:48:14,784 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:48:14,784 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:14,784 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:48:14,785 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:48:14,785 INFO  L87              Difference]: Start difference. First operand 1894 states and 7086 transitions. Second operand 3 states.
[2020-10-16 12:48:14,810 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:14,811 INFO  L93              Difference]: Finished difference Result 1810 states and 6742 transitions.
[2020-10-16 12:48:14,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:48:14,811 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2020-10-16 12:48:14,812 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:14,827 INFO  L225             Difference]: With dead ends: 1810
[2020-10-16 12:48:14,828 INFO  L226             Difference]: Without dead ends: 1810
[2020-10-16 12:48:14,828 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 12:48:14,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1810 states.
[2020-10-16 12:48:14,895 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810.
[2020-10-16 12:48:14,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1810 states.
[2020-10-16 12:48:14,977 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 6742 transitions.
[2020-10-16 12:48:14,978 INFO  L78                 Accepts]: Start accepts. Automaton has 1810 states and 6742 transitions. Word has length 14
[2020-10-16 12:48:14,978 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:14,978 INFO  L481      AbstractCegarLoop]: Abstraction has 1810 states and 6742 transitions.
[2020-10-16 12:48:14,978 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:48:14,978 INFO  L276                IsEmpty]: Start isEmpty. Operand 1810 states and 6742 transitions.
[2020-10-16 12:48:14,982 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 12:48:14,982 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:14,982 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:48:14,982 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 12:48:14,983 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:14,983 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:14,983 INFO  L82        PathProgramCache]: Analyzing trace with hash 2078114566, now seen corresponding path program 1 times
[2020-10-16 12:48:14,984 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:14,985 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013637742]
[2020-10-16 12:48:14,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:15,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:15,160 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 12:48:15,160 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013637742]
[2020-10-16 12:48:15,160 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:15,161 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:48:15,164 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1596057004]
[2020-10-16 12:48:15,164 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:15,168 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:15,183 INFO  L258    McrAutomatonBuilder]: Finished intersection with 63 states and 134 transitions.
[2020-10-16 12:48:15,183 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:15,367 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,419 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,435 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,455 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,484 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,504 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,529 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,573 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,589 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,616 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,693 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,716 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,732 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,739 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,757 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:15,828 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [29894#(not (= 4 ~__unbuffered_cnt~0))]
[2020-10-16 12:48:15,828 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:48:15,829 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:15,829 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:48:15,829 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:48:15,830 INFO  L87              Difference]: Start difference. First operand 1810 states and 6742 transitions. Second operand 5 states.
[2020-10-16 12:48:15,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:15,936 INFO  L93              Difference]: Finished difference Result 1415 states and 4725 transitions.
[2020-10-16 12:48:15,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:48:15,937 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-16 12:48:15,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:15,945 INFO  L225             Difference]: With dead ends: 1415
[2020-10-16 12:48:15,945 INFO  L226             Difference]: Without dead ends: 935
[2020-10-16 12:48:15,945 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:48:15,950 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 935 states.
[2020-10-16 12:48:15,979 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935.
[2020-10-16 12:48:15,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 935 states.
[2020-10-16 12:48:15,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2840 transitions.
[2020-10-16 12:48:15,982 INFO  L78                 Accepts]: Start accepts. Automaton has 935 states and 2840 transitions. Word has length 16
[2020-10-16 12:48:15,983 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:15,983 INFO  L481      AbstractCegarLoop]: Abstraction has 935 states and 2840 transitions.
[2020-10-16 12:48:15,983 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:48:15,983 INFO  L276                IsEmpty]: Start isEmpty. Operand 935 states and 2840 transitions.
[2020-10-16 12:48:15,985 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 12:48:15,985 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:15,986 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]
[2020-10-16 12:48:15,986 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 12:48:15,986 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:15,986 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:15,986 INFO  L82        PathProgramCache]: Analyzing trace with hash -1356517766, now seen corresponding path program 1 times
[2020-10-16 12:48:15,988 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:15,988 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719034663]
[2020-10-16 12:48:15,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:16,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:16,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 12:48:16,172 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719034663]
[2020-10-16 12:48:16,173 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:16,173 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:48:16,173 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1450154722]
[2020-10-16 12:48:16,173 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:16,179 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:16,201 INFO  L258    McrAutomatonBuilder]: Finished intersection with 58 states and 102 transitions.
[2020-10-16 12:48:16,202 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:16,518 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [33190#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 12:48:16,519 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:48:16,519 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:16,519 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:48:16,519 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:48:16,520 INFO  L87              Difference]: Start difference. First operand 935 states and 2840 transitions. Second operand 7 states.
[2020-10-16 12:48:16,589 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:16,589 INFO  L93              Difference]: Finished difference Result 825 states and 2477 transitions.
[2020-10-16 12:48:16,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:48:16,590 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 20
[2020-10-16 12:48:16,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:16,596 INFO  L225             Difference]: With dead ends: 825
[2020-10-16 12:48:16,596 INFO  L226             Difference]: Without dead ends: 726
[2020-10-16 12:48:16,596 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:48:16,600 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 726 states.
[2020-10-16 12:48:16,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726.
[2020-10-16 12:48:16,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 726 states.
[2020-10-16 12:48:16,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2213 transitions.
[2020-10-16 12:48:16,616 INFO  L78                 Accepts]: Start accepts. Automaton has 726 states and 2213 transitions. Word has length 20
[2020-10-16 12:48:16,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:16,616 INFO  L481      AbstractCegarLoop]: Abstraction has 726 states and 2213 transitions.
[2020-10-16 12:48:16,617 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:48:16,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 726 states and 2213 transitions.
[2020-10-16 12:48:16,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:48:16,619 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:16,619 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, 1]
[2020-10-16 12:48:16,619 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 12:48:16,620 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:16,620 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:16,620 INFO  L82        PathProgramCache]: Analyzing trace with hash -1918261777, now seen corresponding path program 1 times
[2020-10-16 12:48:16,621 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:16,622 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657295064]
[2020-10-16 12:48:16,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:16,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:16,982 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 12:48:16,983 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657295064]
[2020-10-16 12:48:16,983 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:16,983 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:48:16,984 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [830469551]
[2020-10-16 12:48:16,984 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:16,990 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:17,023 INFO  L258    McrAutomatonBuilder]: Finished intersection with 60 states and 95 transitions.
[2020-10-16 12:48:17,024 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:17,087 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:17,087 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,088 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,088 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,089 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,089 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,091 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,092 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,093 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,093 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,094 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,094 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,096 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,096 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,098 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,098 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,099 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,099 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,108 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,112 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,116 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 12:48:17,126 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 12:48:17,160 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,185 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,188 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:17,253 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:17,254 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,254 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,255 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,255 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,256 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,257 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,258 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,258 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,259 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,259 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,260 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,261 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,261 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,262 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,262 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,263 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,264 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,265 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,268 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:17,274 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,285 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,313 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,335 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,338 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:17,359 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term
[2020-10-16 12:48:17,360 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,360 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term
[2020-10-16 12:48:17,360 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,362 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 12:48:17,362 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,363 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 12:48:17,363 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,364 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 12:48:17,364 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:17,522 WARN  L193               SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38
[2020-10-16 12:48:17,629 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 2, 1] term
[2020-10-16 12:48:17,629 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,664 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:17,664 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,665 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 4, 2, 1] term
[2020-10-16 12:48:17,665 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,665 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 4, 2, 1] term
[2020-10-16 12:48:17,666 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,671 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:17,671 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 12:48:17,672 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,673 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,673 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,675 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,677 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,677 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,678 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,679 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,681 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,682 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,682 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,684 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,689 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 4, 3, 4, 2, 4, 2, 4, 2, 1] term
[2020-10-16 12:48:17,689 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,690 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 4, 3, 4, 2, 4, 2, 4, 2, 1] term
[2020-10-16 12:48:17,690 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,691 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 4, 3, 4, 2, 4, 2, 4, 2, 1] term
[2020-10-16 12:48:17,692 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,695 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 2, 4, 2, 3, 1] term
[2020-10-16 12:48:17,695 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,697 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 2, 4, 2, 3, 1] term
[2020-10-16 12:48:17,697 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,698 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 2, 4, 2, 3, 1] term
[2020-10-16 12:48:17,698 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,700 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 2, 4, 2, 3, 1] term
[2020-10-16 12:48:17,701 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,702 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 3, 5, 2, 4, 2, 3, 1] term
[2020-10-16 12:48:17,702 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,704 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 3, 5, 2, 4, 2, 3, 1] term
[2020-10-16 12:48:17,704 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,708 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 3, 4, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:17,708 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,710 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 3, 4, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:17,710 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,712 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 3, 4, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:17,712 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,715 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:17,719 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:17,726 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,736 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,763 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,799 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,828 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,926 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:17,977 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 12:48:18,004 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:18,087 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:18,155 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:18,253 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:19,223 WARN  L193               SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 34
[2020-10-16 12:48:19,244 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term
[2020-10-16 12:48:19,245 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,245 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term
[2020-10-16 12:48:19,246 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,249 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 12:48:19,249 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,250 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 12:48:19,250 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,251 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 12:48:19,251 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:19,293 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term
[2020-10-16 12:48:19,294 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,294 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term
[2020-10-16 12:48:19,294 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,296 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 12:48:19,296 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,297 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 12:48:19,297 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,298 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 12:48:19,298 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:19,372 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 1] term
[2020-10-16 12:48:19,373 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,378 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:19,378 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 12:48:19,379 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,380 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,381 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,385 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:19,385 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:19,386 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:19,386 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:19,387 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:19,387 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:19,389 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:19,390 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,391 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:19,392 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,392 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 3, 2, 3, 1] term
[2020-10-16 12:48:19,393 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,393 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 2, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,394 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,394 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 2, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,394 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,397 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 3, 2, 3, 1] term
[2020-10-16 12:48:19,397 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,399 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,399 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,403 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,403 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,405 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 2, 4, 3, 3, 3, 1] term
[2020-10-16 12:48:19,405 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,406 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 3, 2, 3, 1] term
[2020-10-16 12:48:19,406 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,407 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 2, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,407 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,408 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 2, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,408 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,410 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 3, 2, 3, 1] term
[2020-10-16 12:48:19,410 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,411 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,411 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,412 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,413 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,415 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,415 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,416 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,416 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,418 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,418 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,420 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,420 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,422 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,422 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,423 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 2, 3, 1] term
[2020-10-16 12:48:19,423 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,425 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:19,427 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:19,431 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:19,437 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:19,451 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:19,487 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:19,567 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:19,626 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 12:48:19,684 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:19,760 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:19,926 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,045 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:20,046 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,047 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 3, 2, 1] term
[2020-10-16 12:48:20,047 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,048 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 2, 1] term
[2020-10-16 12:48:20,048 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,059 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 3, 4, 2, 4, 2, 1] term
[2020-10-16 12:48:20,060 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,066 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,066 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,067 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,068 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,068 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,069 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,069 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,071 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,072 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,074 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,075 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,075 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,076 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,077 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,079 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,080 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,082 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,083 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,083 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,084 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,086 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,087 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,089 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,090 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,093 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,094 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,094 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,095 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,096 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,096 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,098 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,099 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,100 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,100 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,101 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,102 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,103 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,103 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,104 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,105 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,106 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,106 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,109 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,110 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,112 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,113 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,114 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,114 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,116 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,118 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 12:48:20,121 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,127 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,150 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,189 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,261 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,367 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term
[2020-10-16 12:48:20,367 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,368 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term
[2020-10-16 12:48:20,368 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,370 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 12:48:20,370 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,371 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 12:48:20,371 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,372 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 12:48:20,372 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,441 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 1] term
[2020-10-16 12:48:20,442 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,444 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,444 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,445 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,446 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,447 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,448 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,449 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,450 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,450 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,453 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:20,454 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,455 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:20,455 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,456 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:20,456 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 12:48:20,458 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:20,458 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,459 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 12:48:20,460 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,460 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,461 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,461 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,465 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,466 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,466 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,467 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,467 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,468 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,469 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,470 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,470 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,471 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,471 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,472 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,473 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,474 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,474 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,475 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,475 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,476 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,476 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,477 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,477 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,478 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,478 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,480 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,480 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,482 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,482 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,483 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,483 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,484 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,484 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,486 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,486 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,487 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 1] term
[2020-10-16 12:48:20,487 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,488 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 12:48:20,491 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,495 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 12:48:20,506 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 12:48:20,526 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,564 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,695 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 12:48:20,819 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [35477#(or (= ~__unbuffered_p3_EAX~0 0) (and (or (= (mod ~z$w_buff0_used~0 256) 0) (not (= ~z$w_buff0~0 0))) (or (and (not (= ~z~0 0)) (< 0 (+ (div ~z$w_buff0_used~0 256) 1)) (or (= (mod ~z$w_buff1_used~0 256) 0) (= (mod ~z$r_buff1_thd4~0 256) 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256)))) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd4~0 256) 0)))))), 35478#(and (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff1_thd4~0 256) 0)) (or (and (< 0 (+ (div ~z$w_buff0_used~0 256) 1)) (or (= (mod ~z$w_buff1_used~0 256) 0) (= (mod ~z$r_buff1_thd4~0 256) 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256)))) (= ~z~0 0) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd4~0 256) 0)))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0) (= (mod ~z$r_buff1_thd4~0 256) 0) (not (= (mod ~z$r_buff0_thd4~0 256) 0))))]
[2020-10-16 12:48:20,819 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 12:48:20,820 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:20,820 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 12:48:20,820 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2020-10-16 12:48:20,821 INFO  L87              Difference]: Start difference. First operand 726 states and 2213 transitions. Second operand 9 states.
[2020-10-16 12:48:21,294 WARN  L193               SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 50
[2020-10-16 12:48:21,819 WARN  L193               SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46
[2020-10-16 12:48:22,151 WARN  L193               SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41
[2020-10-16 12:48:22,517 WARN  L193               SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38
[2020-10-16 12:48:22,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:22,520 INFO  L93              Difference]: Finished difference Result 918 states and 2716 transitions.
[2020-10-16 12:48:22,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-16 12:48:22,520 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 23
[2020-10-16 12:48:22,520 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:22,526 INFO  L225             Difference]: With dead ends: 918
[2020-10-16 12:48:22,527 INFO  L226             Difference]: Without dead ends: 836
[2020-10-16 12:48:22,527 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342
[2020-10-16 12:48:22,530 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 836 states.
[2020-10-16 12:48:22,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 726.
[2020-10-16 12:48:22,545 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 726 states.
[2020-10-16 12:48:22,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2180 transitions.
[2020-10-16 12:48:22,548 INFO  L78                 Accepts]: Start accepts. Automaton has 726 states and 2180 transitions. Word has length 23
[2020-10-16 12:48:22,548 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:22,549 INFO  L481      AbstractCegarLoop]: Abstraction has 726 states and 2180 transitions.
[2020-10-16 12:48:22,549 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 12:48:22,549 INFO  L276                IsEmpty]: Start isEmpty. Operand 726 states and 2180 transitions.
[2020-10-16 12:48:22,551 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 12:48:22,551 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:22,551 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, 1]
[2020-10-16 12:48:22,552 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 12:48:22,552 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:22,552 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:22,552 INFO  L82        PathProgramCache]: Analyzing trace with hash 419801035, now seen corresponding path program 2 times
[2020-10-16 12:48:22,553 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:22,554 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063404852]
[2020-10-16 12:48:22,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:22,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:22,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:48:22,688 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063404852]
[2020-10-16 12:48:22,689 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:22,689 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 12:48:22,689 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2004682485]
[2020-10-16 12:48:22,689 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:22,695 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:22,734 INFO  L258    McrAutomatonBuilder]: Finished intersection with 73 states and 132 transitions.
[2020-10-16 12:48:22,734 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:22,983 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [37881#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 12:48:22,984 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 12:48:22,984 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:22,984 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 12:48:22,984 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:48:22,985 INFO  L87              Difference]: Start difference. First operand 726 states and 2180 transitions. Second operand 8 states.
[2020-10-16 12:48:23,067 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:23,067 INFO  L93              Difference]: Finished difference Result 701 states and 2128 transitions.
[2020-10-16 12:48:23,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 12:48:23,068 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2020-10-16 12:48:23,068 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:23,073 INFO  L225             Difference]: With dead ends: 701
[2020-10-16 12:48:23,073 INFO  L226             Difference]: Without dead ends: 589
[2020-10-16 12:48:23,074 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-10-16 12:48:23,078 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 589 states.
[2020-10-16 12:48:23,092 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589.
[2020-10-16 12:48:23,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 589 states.
[2020-10-16 12:48:23,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1795 transitions.
[2020-10-16 12:48:23,095 INFO  L78                 Accepts]: Start accepts. Automaton has 589 states and 1795 transitions. Word has length 23
[2020-10-16 12:48:23,095 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:23,095 INFO  L481      AbstractCegarLoop]: Abstraction has 589 states and 1795 transitions.
[2020-10-16 12:48:23,095 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 12:48:23,095 INFO  L276                IsEmpty]: Start isEmpty. Operand 589 states and 1795 transitions.
[2020-10-16 12:48:23,097 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-16 12:48:23,097 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:23,098 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, 1, 1, 1, 1]
[2020-10-16 12:48:23,098 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 12:48:23,098 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:23,098 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:23,098 INFO  L82        PathProgramCache]: Analyzing trace with hash -1974188671, now seen corresponding path program 1 times
[2020-10-16 12:48:23,100 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:23,100 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696810939]
[2020-10-16 12:48:23,100 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:23,121 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:23,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 12:48:23,151 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696810939]
[2020-10-16 12:48:23,151 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:23,151 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:48:23,152 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075827208]
[2020-10-16 12:48:23,152 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:23,159 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:23,231 INFO  L258    McrAutomatonBuilder]: Finished intersection with 104 states and 200 transitions.
[2020-10-16 12:48:23,231 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:23,304 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 12:48:23,305 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:48:23,305 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:23,305 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:48:23,305 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:48:23,306 INFO  L87              Difference]: Start difference. First operand 589 states and 1795 transitions. Second operand 3 states.
[2020-10-16 12:48:23,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:23,318 INFO  L93              Difference]: Finished difference Result 807 states and 2391 transitions.
[2020-10-16 12:48:23,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:48:23,319 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 26
[2020-10-16 12:48:23,319 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:23,322 INFO  L225             Difference]: With dead ends: 807
[2020-10-16 12:48:23,322 INFO  L226             Difference]: Without dead ends: 373
[2020-10-16 12:48:23,323 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 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 12:48:23,325 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 373 states.
[2020-10-16 12:48:23,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373.
[2020-10-16 12:48:23,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 373 states.
[2020-10-16 12:48:23,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1021 transitions.
[2020-10-16 12:48:23,336 INFO  L78                 Accepts]: Start accepts. Automaton has 373 states and 1021 transitions. Word has length 26
[2020-10-16 12:48:23,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:23,337 INFO  L481      AbstractCegarLoop]: Abstraction has 373 states and 1021 transitions.
[2020-10-16 12:48:23,337 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:48:23,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 373 states and 1021 transitions.
[2020-10-16 12:48:23,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-16 12:48:23,339 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:23,340 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, 1, 1, 1, 1]
[2020-10-16 12:48:23,340 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 12:48:23,340 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:23,341 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:23,341 INFO  L82        PathProgramCache]: Analyzing trace with hash 294332599, now seen corresponding path program 2 times
[2020-10-16 12:48:23,343 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:23,343 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330817591]
[2020-10-16 12:48:23,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:23,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:48:23,403 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 12:48:23,403 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330817591]
[2020-10-16 12:48:23,403 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:48:23,403 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:48:23,404 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1569953057]
[2020-10-16 12:48:23,404 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 12:48:23,411 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 12:48:23,587 INFO  L258    McrAutomatonBuilder]: Finished intersection with 130 states and 270 transitions.
[2020-10-16 12:48:23,588 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 12:48:23,790 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 12:48:23,791 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:48:23,791 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:48:23,791 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:48:23,791 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:48:23,792 INFO  L87              Difference]: Start difference. First operand 373 states and 1021 transitions. Second operand 4 states.
[2020-10-16 12:48:23,810 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:48:23,811 INFO  L93              Difference]: Finished difference Result 487 states and 1311 transitions.
[2020-10-16 12:48:23,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:48:23,811 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 26
[2020-10-16 12:48:23,812 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:48:23,814 INFO  L225             Difference]: With dead ends: 487
[2020-10-16 12:48:23,814 INFO  L226             Difference]: Without dead ends: 205
[2020-10-16 12:48:23,814 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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 12:48:23,815 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 205 states.
[2020-10-16 12:48:23,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205.
[2020-10-16 12:48:23,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 205 states.
[2020-10-16 12:48:23,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 497 transitions.
[2020-10-16 12:48:23,821 INFO  L78                 Accepts]: Start accepts. Automaton has 205 states and 497 transitions. Word has length 26
[2020-10-16 12:48:23,821 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:48:23,821 INFO  L481      AbstractCegarLoop]: Abstraction has 205 states and 497 transitions.
[2020-10-16 12:48:23,821 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:48:23,821 INFO  L276                IsEmpty]: Start isEmpty. Operand 205 states and 497 transitions.
[2020-10-16 12:48:23,822 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-16 12:48:23,822 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:48:23,823 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, 1, 1, 1, 1]
[2020-10-16 12:48:23,823 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 12:48:23,823 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:48:23,823 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:48:23,823 INFO  L82        PathProgramCache]: Analyzing trace with hash -1948896009, now seen corresponding path program 3 times
[2020-10-16 12:48:23,825 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:48:23,825 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209958857]
[2020-10-16 12:48:23,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:48:23,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:48:23,870 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:48:23,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:48:23,927 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:48:23,983 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 12:48:23,983 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 12:48:23,983 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 12:48:23,984 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 12:48:24,005 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1199] [1199] L2-->L876: Formula: (let ((.cse6 (= (mod ~z$w_buff1_used~0_In-2048373374 256) 0)) (.cse7 (= 0 (mod ~z$r_buff1_thd0~0_In-2048373374 256))) (.cse9 (= (mod ~z$w_buff0_used~0_In-2048373374 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In-2048373374 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_In-2048373374 ~z$r_buff1_thd0~0_Out-2048373374) (or (and (= ~z$w_buff0_used~0_Out-2048373374 0) .cse0 .cse1) (and (= ~z$w_buff0_used~0_In-2048373374 ~z$w_buff0_used~0_Out-2048373374) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2048373374 0)) (or (and (= ~z$w_buff0~0_In-2048373374 ~z~0_Out-2048373374) .cse0 .cse1) (and .cse2 (or (and .cse3 (= ~z~0_In-2048373374 ~z~0_Out-2048373374)) (and .cse4 (= ~z$w_buff1~0_In-2048373374 ~z~0_Out-2048373374) .cse5)))) (= ~z$r_buff0_thd0~0_Out-2048373374 ~z$r_buff0_thd0~0_In-2048373374) (or (and .cse4 (= ~z$w_buff1_used~0_Out-2048373374 0) .cse5) (and .cse3 (= ~z$w_buff1_used~0_Out-2048373374 ~z$w_buff1_used~0_In-2048373374))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2048373374| ULTIMATE.start_assume_abort_if_not_~cond_Out-2048373374))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2048373374|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2048373374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2048373374, ~z$w_buff0~0=~z$w_buff0~0_In-2048373374, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2048373374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2048373374, ~z$w_buff1~0=~z$w_buff1~0_In-2048373374, ~z~0=~z~0_In-2048373374}  OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2048373374, ~z$w_buff0~0=~z$w_buff0~0_In-2048373374, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2048373374, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-2048373374|, ~z$w_buff1~0=~z$w_buff1~0_In-2048373374, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2048373374|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2048373374|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2048373374|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2048373374|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-2048373374, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2048373374|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2048373374|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2048373374, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2048373374, ~z~0=~z~0_Out-2048373374}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~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~ite59, ~z~0] because there is no mapped edge
[2020-10-16 12:48:24,011 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 12:48:24,011 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,012 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 12:48:24,012 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,012 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 12:48:24,012 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,013 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 12:48:24,013 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,013 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 12:48:24,013 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,013 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 12:48:24,014 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,014 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 12:48:24,014 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,014 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 12:48:24,014 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,014 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 12:48:24,015 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,015 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 12:48:24,015 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,015 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 12:48:24,015 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,015 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 12:48:24,016 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,016 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 12:48:24,016 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,016 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 12:48:24,016 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,018 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 12:48:24,018 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,018 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 12:48:24,019 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,019 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 12:48:24,019 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,019 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 12:48:24,019 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,019 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 12:48:24,020 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,020 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 12:48:24,020 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,020 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 12:48:24,020 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,020 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 12:48:24,021 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,021 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 12:48:24,021 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,021 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 12:48:24,021 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,021 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 12:48:24,022 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,022 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 12:48:24,022 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,022 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 12:48:24,022 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,023 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 12:48:24,023 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,023 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 12:48:24,023 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,023 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 12:48:24,023 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,024 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 12:48:24,024 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,024 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 12:48:24,024 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:48:24,101 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:48:24 BasicIcfg
[2020-10-16 12:48:24,102 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 12:48:24,104 INFO  L168              Benchmark]: Toolchain (without parser) took 18124.75 ms. Allocated memory was 140.0 MB in the beginning and 614.5 MB in the end (delta: 474.5 MB). Free memory was 101.2 MB in the beginning and 364.8 MB in the end (delta: -263.6 MB). Peak memory consumption was 210.8 MB. Max. memory is 7.1 GB.
[2020-10-16 12:48:24,104 INFO  L168              Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
[2020-10-16 12:48:24,105 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 836.53 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 101.2 MB in the beginning and 154.8 MB in the end (delta: -53.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB.
[2020-10-16 12:48:24,106 INFO  L168              Benchmark]: Boogie Procedure Inliner took 92.01 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 151.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB.
[2020-10-16 12:48:24,106 INFO  L168              Benchmark]: Boogie Preprocessor took 45.77 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 148.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
[2020-10-16 12:48:24,107 INFO  L168              Benchmark]: RCFGBuilder took 2607.37 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 148.9 MB in the beginning and 116.2 MB in the end (delta: 32.8 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB.
[2020-10-16 12:48:24,108 INFO  L168              Benchmark]: TraceAbstraction took 14537.12 ms. Allocated memory was 248.5 MB in the beginning and 614.5 MB in the end (delta: 366.0 MB). Free memory was 116.2 MB in the beginning and 364.8 MB in the end (delta: -248.6 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB.
[2020-10-16 12:48:24,113 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.26 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 836.53 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 101.2 MB in the beginning and 154.8 MB in the end (delta: -53.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 92.01 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 151.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 45.77 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 148.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2607.37 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 148.9 MB in the beginning and 116.2 MB in the end (delta: 32.8 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 14537.12 ms. Allocated memory was 248.5 MB in the beginning and 614.5 MB in the end (delta: 366.0 MB). Free memory was 116.2 MB in the beginning and 364.8 MB in the end (delta: -248.6 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1279 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.2s, 123 PlacesBefore, 45 PlacesAfterwards, 112 TransitionsBefore, 32 TransitionsAfterwards, 2446 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 7121 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p1_EAX = 0;
[L703]               0  int __unbuffered_p2_EAX = 0;
[L705]               0  int __unbuffered_p2_EBX = 0;
[L707]               0  int __unbuffered_p3_EAX = 0;
[L709]               0  int __unbuffered_p3_EBX = 0;
[L711]               0  int a = 0;
[L712]               0  _Bool main$tmp_guard0;
[L713]               0  _Bool main$tmp_guard1;
[L715]               0  int x = 0;
[L717]               0  int y = 0;
[L719]               0  int z = 0;
[L720]               0  _Bool z$flush_delayed;
[L721]               0  int z$mem_tmp;
[L722]               0  _Bool z$r_buff0_thd0;
[L723]               0  _Bool z$r_buff0_thd1;
[L724]               0  _Bool z$r_buff0_thd2;
[L725]               0  _Bool z$r_buff0_thd3;
[L726]               0  _Bool z$r_buff0_thd4;
[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$r_buff1_thd4;
[L732]               0  _Bool z$read_delayed;
[L733]               0  int *z$read_delayed_var;
[L734]               0  int z$w_buff0;
[L735]               0  _Bool z$w_buff0_used;
[L736]               0  int z$w_buff1;
[L737]               0  _Bool z$w_buff1_used;
[L738]               0  _Bool weak$$choice0;
[L739]               0  _Bool weak$$choice2;
[L858]               0  pthread_t t149;
[L859]  FCALL, FORK  0  pthread_create(&t149, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L860]               0  pthread_t t150;
[L861]  FCALL, FORK  0  pthread_create(&t150, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L862]               0  pthread_t t151;
[L863]  FCALL, FORK  0  pthread_create(&t151, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L864]               0  pthread_t t152;
[L865]  FCALL, FORK  0  pthread_create(&t152, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L804]               4  z$w_buff1 = z$w_buff0
[L805]               4  z$w_buff0 = 1
[L806]               4  z$w_buff1_used = z$w_buff0_used
[L807]               4  z$w_buff0_used = (_Bool)1
[L7]    COND FALSE   4  !(!expression)
[L809]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L810]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L811]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L812]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L813]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L814]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L817]               4  weak$$choice0 = __VERIFIER_nondet_bool()
[L818]               4  weak$$choice2 = __VERIFIER_nondet_bool()
[L819]               4  z$flush_delayed = weak$$choice2
[L820]               4  z$mem_tmp = z
[L821]  EXPR         4  !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1)
[L821]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1
[L821]  EXPR         4  !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1)
[L821]               4  z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1)
[L822]  EXPR         4  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0))
[L822]  EXPR         4  !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)
[L822]  EXPR         4  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0))
[L822]               4  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0))
[L823]  EXPR         4  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L823]  EXPR         4  !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)
[L823]  EXPR         4  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L823]               4  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1))
[L824]  EXPR         4  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used))
[L824]               4  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used))
[L825]  EXPR         4  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L825]               4  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L826]  EXPR         4  weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L826]  EXPR         4  !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)
[L826]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L826]  EXPR         4  !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)
[L826]  EXPR         4  weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L826]               4  z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4))
[L827]  EXPR         4  weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L827]               4  z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L828]               4  __unbuffered_p3_EAX = z
[L829]  EXPR         4  z$flush_delayed ? z$mem_tmp : z
[L829]               4  z = z$flush_delayed ? z$mem_tmp : z
[L830]               4  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L833]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L743]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L746]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L758]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L761]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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_cnt = __unbuffered_cnt + 1
[L753]               1  return 0;
[L766]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L768]               2  return 0;
[L773]               3  y = 1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L776]               3  __unbuffered_p2_EAX = y
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L779]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L780]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L781]               3  z$flush_delayed = weak$$choice2
[L782]               3  z$mem_tmp = z
[L783]  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)
[L783]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1
[L783]  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)
[L783]               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)
[L784]  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))
[L784]  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)
[L784]  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))
[L784]               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))
[L785]  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))
[L785]  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)
[L785]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1
[L785]  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)
[L785]  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))
[L785]               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))
[L786]  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))
[L786]               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))
[L787]  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))
[L787]  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)
[L787]  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))
[L787]               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))
[L788]  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))
[L788]               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))
[L789]  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))
[L789]               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))
[L790]               3  __unbuffered_p2_EBX = z
[L791]  EXPR         3  z$flush_delayed ? z$mem_tmp : z
[L791]               3  z = z$flush_delayed ? z$mem_tmp : z
[L792]               3  z$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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]
[L836]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L836]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L837]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L837]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L838]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L838]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L839]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L839]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L840]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L840]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L799]               3  return 0;
[L843]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L845]               4  return 0;
[L867]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L878]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 319 SDtfs, 452 SDslu, 597 SDs, 0 SdLazy, 226 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 306 SyntacticMatches, 18 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 110 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 14063 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...