/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/mix027_pso.opt.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 13:02:30,726 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 13:02:30,729 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 13:02:30,756 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 13:02:30,757 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 13:02:30,758 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 13:02:30,759 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 13:02:30,761 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 13:02:30,762 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 13:02:30,763 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 13:02:30,764 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 13:02:30,765 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 13:02:30,765 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 13:02:30,766 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 13:02:30,767 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 13:02:30,768 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 13:02:30,769 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 13:02:30,770 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 13:02:30,772 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 13:02:30,774 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 13:02:30,775 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 13:02:30,776 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 13:02:30,777 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 13:02:30,778 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 13:02:30,781 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 13:02:30,781 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 13:02:30,781 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 13:02:30,782 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 13:02:30,783 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 13:02:30,784 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 13:02:30,784 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 13:02:30,784 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 13:02:30,785 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 13:02:30,786 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 13:02:30,787 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 13:02:30,787 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 13:02:30,788 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 13:02:30,788 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 13:02:30,788 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 13:02:30,789 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 13:02:30,790 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 13:02:30,790 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 13:02:30,812 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 13:02:30,813 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 13:02:30,814 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 13:02:30,814 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 13:02:30,814 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 13:02:30,815 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 13:02:30,815 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 13:02:30,815 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 13:02:30,815 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 13:02:30,815 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 13:02:30,815 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 13:02:30,816 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 13:02:30,816 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 13:02:30,816 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 13:02:30,816 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 13:02:30,816 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 13:02:30,817 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 13:02:30,817 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 13:02:30,817 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 13:02:30,817 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 13:02:30,817 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 13:02:30,818 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:02:30,818 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 13:02:30,818 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 13:02:30,818 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 13:02:30,818 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 13:02:30,819 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 13:02:30,819 INFO  L138        SettingsManager]:  * Override the interpolant automaton setting of the refinement strategy=true
[2020-10-16 13:02:30,819 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 13:02:30,819 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 13:02:30,819 INFO  L138        SettingsManager]:  * Interpolant automaton=MCR
[2020-10-16 13:02:31,100 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 13:02:31,111 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 13:02:31,115 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 13:02:31,120 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 13:02:31,120 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 13:02:31,121 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i
[2020-10-16 13:02:31,194 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9d615751f/8eda615e7e1746bb99f0d01883af67f6/FLAG00a256028
[2020-10-16 13:02:31,766 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 13:02:31,766 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i
[2020-10-16 13:02:31,782 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9d615751f/8eda615e7e1746bb99f0d01883af67f6/FLAG00a256028
[2020-10-16 13:02:32,031 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9d615751f/8eda615e7e1746bb99f0d01883af67f6
[2020-10-16 13:02:32,041 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 13:02:32,043 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 13:02:32,044 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 13:02:32,044 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 13:02:32,048 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 13:02:32,049 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,052 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482da65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32, skipping insertion in model container
[2020-10-16 13:02:32,052 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,060 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 13:02:32,105 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 13:02:32,633 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:02:32,646 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 13:02:32,739 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:02:32,820 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 13:02:32,820 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32 WrapperNode
[2020-10-16 13:02:32,820 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 13:02:32,821 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 13:02:32,821 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 13:02:32,822 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 13:02:32,831 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,850 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,889 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 13:02:32,890 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 13:02:32,890 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 13:02:32,890 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 13:02:32,898 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,898 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,903 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,903 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,914 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,918 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,922 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (1/1) ...
[2020-10-16 13:02:32,927 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 13:02:32,928 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 13:02:32,929 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 13:02:32,929 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 13:02:32,930 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (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 13:02:32,992 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 13:02:32,992 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 13:02:32,992 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 13:02:32,993 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 13:02:32,993 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 13:02:32,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 13:02:32,999 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 13:02:32,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 13:02:33,000 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 13:02:33,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 13:02:33,000 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 13:02:33,001 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 13:02:33,001 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 13:02:33,001 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 13:02:33,002 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 13:02:33,004 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 13:02:34,893 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 13:02:34,893 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 13:02:34,896 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:02:34 BoogieIcfgContainer
[2020-10-16 13:02:34,896 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 13:02:34,897 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 13:02:34,898 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 13:02:34,901 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 13:02:34,901 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:02:32" (1/3) ...
[2020-10-16 13:02:34,902 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608b84e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:02:34, skipping insertion in model container
[2020-10-16 13:02:34,902 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:02:32" (2/3) ...
[2020-10-16 13:02:34,903 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608b84e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:02:34, skipping insertion in model container
[2020-10-16 13:02:34,903 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:02:34" (3/3) ...
[2020-10-16 13:02:34,904 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix027_pso.opt.i
[2020-10-16 13:02:34,916 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 13:02:34,917 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 13:02:34,925 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 13:02:34,926 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 13:02:34,959 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,959 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,959 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,960 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,960 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,960 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,961 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,961 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,961 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,961 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,962 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,963 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,963 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,963 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,963 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,963 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,964 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,964 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,964 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,964 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,964 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,965 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,965 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,965 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,965 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,965 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,965 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,966 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,966 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,966 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,966 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,966 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,966 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,967 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,967 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,967 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,967 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,967 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,970 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,970 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,971 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,971 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,971 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,971 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,972 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,972 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,972 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,972 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,974 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,974 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,974 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,975 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,975 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,975 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,975 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,976 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,976 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,976 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,976 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,976 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,977 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,977 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,977 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,977 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,982 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,982 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,982 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,982 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,983 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,983 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,983 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,983 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,983 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,984 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,986 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,987 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,987 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,987 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,993 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,994 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,994 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,994 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,994 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,995 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,995 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,995 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,995 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,995 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,996 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,996 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,996 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,996 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,997 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,997 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,997 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,997 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,997 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,997 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,998 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,998 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,998 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,998 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,998 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,999 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:34,999 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,000 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,001 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,001 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,001 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,001 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,002 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,002 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,002 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,002 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,002 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,003 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,003 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:02:35,004 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 13:02:35,018 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 13:02:35,038 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 13:02:35,038 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 13:02:35,039 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 13:02:35,039 INFO  L380      AbstractCegarLoop]: Backedges is MCR
[2020-10-16 13:02:35,039 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 13:02:35,039 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 13:02:35,039 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 13:02:35,039 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 13:02:35,054 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 13:02:35,054 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 240 flow
[2020-10-16 13:02:35,057 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 240 flow
[2020-10-16 13:02:35,059 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow
[2020-10-16 13:02:35,111 INFO  L129       PetriNetUnfolder]: 2/106 cut-off events.
[2020-10-16 13:02:35,111 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 13:02:35,116 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. 
[2020-10-16 13:02:35,120 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2456
[2020-10-16 13:02:35,569 WARN  L193               SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 13:02:37,909 WARN  L193               SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-16 13:02:38,031 WARN  L193               SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-16 13:02:38,042 INFO  L132        LiptonReduction]: Checked pairs total: 7666
[2020-10-16 13:02:38,043 INFO  L134        LiptonReduction]: Total number of compositions: 89
[2020-10-16 13:02:38,049 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow
[2020-10-16 13:02:38,338 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4266 states.
[2020-10-16 13:02:38,341 INFO  L276                IsEmpty]: Start isEmpty. Operand 4266 states.
[2020-10-16 13:02:38,348 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 13:02:38,349 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:38,349 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:02:38,350 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:38,355 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:38,356 INFO  L82        PathProgramCache]: Analyzing trace with hash 1359254533, now seen corresponding path program 1 times
[2020-10-16 13:02:38,381 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:38,381 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834300307]
[2020-10-16 13:02:38,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:38,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:38,630 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 13:02:38,632 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834300307]
[2020-10-16 13:02:38,633 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:38,633 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:02:38,634 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956062914]
[2020-10-16 13:02:38,635 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:38,640 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:38,656 INFO  L258    McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions.
[2020-10-16 13:02:38,657 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:38,661 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:02:38,662 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:02:38,662 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:38,676 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:02:38,677 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:02:38,678 INFO  L87              Difference]: Start difference. First operand 4266 states. Second operand 3 states.
[2020-10-16 13:02:38,875 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:38,876 INFO  L93              Difference]: Finished difference Result 3562 states and 14032 transitions.
[2020-10-16 13:02:38,877 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:02:38,878 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 13:02:38,879 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:38,925 INFO  L225             Difference]: With dead ends: 3562
[2020-10-16 13:02:38,926 INFO  L226             Difference]: Without dead ends: 2602
[2020-10-16 13:02:38,927 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 13:02:38,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2602 states.
[2020-10-16 13:02:39,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602.
[2020-10-16 13:02:39,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2602 states.
[2020-10-16 13:02:39,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions.
[2020-10-16 13:02:39,104 INFO  L78                 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 7
[2020-10-16 13:02:39,105 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:39,106 INFO  L481      AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions.
[2020-10-16 13:02:39,106 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:02:39,106 INFO  L276                IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions.
[2020-10-16 13:02:39,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 13:02:39,110 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:39,110 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:02:39,110 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 13:02:39,111 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:39,111 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:39,111 INFO  L82        PathProgramCache]: Analyzing trace with hash -1848027961, now seen corresponding path program 1 times
[2020-10-16 13:02:39,116 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:39,117 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877845696]
[2020-10-16 13:02:39,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:39,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:39,244 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 13:02:39,244 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877845696]
[2020-10-16 13:02:39,245 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:39,245 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:02:39,246 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [453426288]
[2020-10-16 13:02:39,246 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:39,247 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:39,250 INFO  L258    McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions.
[2020-10-16 13:02:39,250 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:39,252 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:02:39,253 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:02:39,253 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:39,254 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:02:39,254 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:02:39,254 INFO  L87              Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states.
[2020-10-16 13:02:39,349 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:39,349 INFO  L93              Difference]: Finished difference Result 2762 states and 10352 transitions.
[2020-10-16 13:02:39,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:02:39,351 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-16 13:02:39,359 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:39,383 INFO  L225             Difference]: With dead ends: 2762
[2020-10-16 13:02:39,383 INFO  L226             Difference]: Without dead ends: 2282
[2020-10-16 13:02:39,384 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 13:02:39,396 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2282 states.
[2020-10-16 13:02:39,463 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282.
[2020-10-16 13:02:39,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2282 states.
[2020-10-16 13:02:39,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions.
[2020-10-16 13:02:39,477 INFO  L78                 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12
[2020-10-16 13:02:39,477 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:39,478 INFO  L481      AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions.
[2020-10-16 13:02:39,478 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:02:39,478 INFO  L276                IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions.
[2020-10-16 13:02:39,484 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 13:02:39,485 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:39,485 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:02:39,485 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 13:02:39,485 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:39,486 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:39,486 INFO  L82        PathProgramCache]: Analyzing trace with hash -2132892829, now seen corresponding path program 1 times
[2020-10-16 13:02:39,492 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:39,492 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257644248]
[2020-10-16 13:02:39,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:39,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:39,589 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 13:02:39,589 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257644248]
[2020-10-16 13:02:39,589 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:39,590 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:02:39,590 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791936426]
[2020-10-16 13:02:39,590 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:39,593 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:39,595 INFO  L258    McrAutomatonBuilder]: Finished intersection with 19 states and 22 transitions.
[2020-10-16 13:02:39,596 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:39,636 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:02:39,637 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:02:39,637 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:39,637 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:02:39,637 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:02:39,638 INFO  L87              Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states.
[2020-10-16 13:02:39,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:39,679 INFO  L93              Difference]: Finished difference Result 2522 states and 9340 transitions.
[2020-10-16 13:02:39,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:02:39,680 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 13:02:39,680 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:39,698 INFO  L225             Difference]: With dead ends: 2522
[2020-10-16 13:02:39,698 INFO  L226             Difference]: Without dead ends: 2202
[2020-10-16 13:02:39,699 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 13:02:39,710 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2202 states.
[2020-10-16 13:02:39,763 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202.
[2020-10-16 13:02:39,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2202 states.
[2020-10-16 13:02:39,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8324 transitions.
[2020-10-16 13:02:39,775 INFO  L78                 Accepts]: Start accepts. Automaton has 2202 states and 8324 transitions. Word has length 14
[2020-10-16 13:02:39,775 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:39,776 INFO  L481      AbstractCegarLoop]: Abstraction has 2202 states and 8324 transitions.
[2020-10-16 13:02:39,776 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:02:39,776 INFO  L276                IsEmpty]: Start isEmpty. Operand 2202 states and 8324 transitions.
[2020-10-16 13:02:39,779 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 13:02:39,779 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:39,779 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:02:39,779 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 13:02:39,780 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:39,780 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:39,780 INFO  L82        PathProgramCache]: Analyzing trace with hash -1695160688, now seen corresponding path program 1 times
[2020-10-16 13:02:39,781 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:39,782 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705265399]
[2020-10-16 13:02:39,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:39,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:39,881 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 13:02:39,882 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705265399]
[2020-10-16 13:02:39,882 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:39,885 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:02:39,885 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [188221625]
[2020-10-16 13:02:39,885 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:39,888 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:39,892 INFO  L258    McrAutomatonBuilder]: Finished intersection with 32 states and 51 transitions.
[2020-10-16 13:02:39,892 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:39,956 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:39,981 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:39,995 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:40,023 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:40,046 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:40,052 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [31693#(= (mod ~main$tmp_guard0~0 256) 0), 31694#(not (= 4 ~__unbuffered_cnt~0))]
[2020-10-16 13:02:40,053 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 13:02:40,053 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:40,053 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 13:02:40,053 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:02:40,054 INFO  L87              Difference]: Start difference. First operand 2202 states and 8324 transitions. Second operand 6 states.
[2020-10-16 13:02:40,173 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:40,174 INFO  L93              Difference]: Finished difference Result 1510 states and 4993 transitions.
[2020-10-16 13:02:40,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:02:40,175 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-16 13:02:40,175 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:40,182 INFO  L225             Difference]: With dead ends: 1510
[2020-10-16 13:02:40,182 INFO  L226             Difference]: Without dead ends: 1030
[2020-10-16 13:02:40,182 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:02:40,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1030 states.
[2020-10-16 13:02:40,207 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030.
[2020-10-16 13:02:40,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1030 states.
[2020-10-16 13:02:40,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 3108 transitions.
[2020-10-16 13:02:40,215 INFO  L78                 Accepts]: Start accepts. Automaton has 1030 states and 3108 transitions. Word has length 15
[2020-10-16 13:02:40,215 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:40,215 INFO  L481      AbstractCegarLoop]: Abstraction has 1030 states and 3108 transitions.
[2020-10-16 13:02:40,215 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 13:02:40,215 INFO  L276                IsEmpty]: Start isEmpty. Operand 1030 states and 3108 transitions.
[2020-10-16 13:02:40,218 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:02:40,218 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:40,218 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 13:02:40,218 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 13:02:40,218 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:40,219 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:40,219 INFO  L82        PathProgramCache]: Analyzing trace with hash 1908579326, now seen corresponding path program 1 times
[2020-10-16 13:02:40,220 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:40,220 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25623762]
[2020-10-16 13:02:40,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:40,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:40,343 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 13:02:40,343 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25623762]
[2020-10-16 13:02:40,344 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:40,344 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 13:02:40,344 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [146040835]
[2020-10-16 13:02:40,344 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:40,348 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:40,356 INFO  L258    McrAutomatonBuilder]: Finished intersection with 49 states and 76 transitions.
[2020-10-16 13:02:40,357 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:40,494 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [35278#(and (= ~__unbuffered_p3_EBX~0 1) (<= ~__unbuffered_cnt~0 0)), 35279#(and (<= ~__unbuffered_cnt~0 0) (= ~a~0 1)), 35280#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 13:02:40,494 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-16 13:02:40,495 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:40,495 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-16 13:02:40,495 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2020-10-16 13:02:40,495 INFO  L87              Difference]: Start difference. First operand 1030 states and 3108 transitions. Second operand 12 states.
[2020-10-16 13:02:40,668 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:40,669 INFO  L93              Difference]: Finished difference Result 1503 states and 4463 transitions.
[2020-10-16 13:02:40,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-10-16 13:02:40,670 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 20
[2020-10-16 13:02:40,671 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:40,678 INFO  L225             Difference]: With dead ends: 1503
[2020-10-16 13:02:40,678 INFO  L226             Difference]: Without dead ends: 1156
[2020-10-16 13:02:40,679 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240
[2020-10-16 13:02:40,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1156 states.
[2020-10-16 13:02:40,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1104.
[2020-10-16 13:02:40,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1104 states.
[2020-10-16 13:02:40,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 3276 transitions.
[2020-10-16 13:02:40,719 INFO  L78                 Accepts]: Start accepts. Automaton has 1104 states and 3276 transitions. Word has length 20
[2020-10-16 13:02:40,720 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:40,720 INFO  L481      AbstractCegarLoop]: Abstraction has 1104 states and 3276 transitions.
[2020-10-16 13:02:40,720 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-16 13:02:40,720 INFO  L276                IsEmpty]: Start isEmpty. Operand 1104 states and 3276 transitions.
[2020-10-16 13:02:40,723 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:02:40,723 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:40,723 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 13:02:40,724 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 13:02:40,724 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:40,724 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:40,724 INFO  L82        PathProgramCache]: Analyzing trace with hash -1242348118, now seen corresponding path program 1 times
[2020-10-16 13:02:40,729 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:40,730 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969918341]
[2020-10-16 13:02:40,730 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:40,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:40,839 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 13:02:40,840 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969918341]
[2020-10-16 13:02:40,840 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:40,840 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:02:40,841 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1149146316]
[2020-10-16 13:02:40,841 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:40,845 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:40,869 INFO  L258    McrAutomatonBuilder]: Finished intersection with 109 states and 218 transitions.
[2020-10-16 13:02:40,870 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:40,883 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term
[2020-10-16 13:02:40,883 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:40,901 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term
[2020-10-16 13:02:40,902 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:41,407 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [39006#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 13:02:41,408 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 13:02:41,408 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:41,408 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 13:02:41,409 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:02:41,409 INFO  L87              Difference]: Start difference. First operand 1104 states and 3276 transitions. Second operand 7 states.
[2020-10-16 13:02:41,487 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:41,487 INFO  L93              Difference]: Finished difference Result 915 states and 2676 transitions.
[2020-10-16 13:02:41,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 13:02:41,488 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 20
[2020-10-16 13:02:41,488 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:41,493 INFO  L225             Difference]: With dead ends: 915
[2020-10-16 13:02:41,494 INFO  L226             Difference]: Without dead ends: 816
[2020-10-16 13:02:41,494 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90
[2020-10-16 13:02:41,498 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 816 states.
[2020-10-16 13:02:41,518 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816.
[2020-10-16 13:02:41,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 816 states.
[2020-10-16 13:02:41,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 2412 transitions.
[2020-10-16 13:02:41,521 INFO  L78                 Accepts]: Start accepts. Automaton has 816 states and 2412 transitions. Word has length 20
[2020-10-16 13:02:41,522 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:41,522 INFO  L481      AbstractCegarLoop]: Abstraction has 816 states and 2412 transitions.
[2020-10-16 13:02:41,522 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 13:02:41,522 INFO  L276                IsEmpty]: Start isEmpty. Operand 816 states and 2412 transitions.
[2020-10-16 13:02:41,528 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 13:02:41,528 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:41,529 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 13:02:41,529 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 13:02:41,529 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:41,529 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:41,529 INFO  L82        PathProgramCache]: Analyzing trace with hash 1343583795, now seen corresponding path program 1 times
[2020-10-16 13:02:41,531 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:41,531 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455439868]
[2020-10-16 13:02:41,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:41,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:41,628 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 13:02:41,629 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455439868]
[2020-10-16 13:02:41,629 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:41,629 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 13:02:41,630 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832199588]
[2020-10-16 13:02:41,630 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:41,635 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:41,674 INFO  L258    McrAutomatonBuilder]: Finished intersection with 120 states and 238 transitions.
[2020-10-16 13:02:41,675 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:42,010 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:02:42,010 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 13:02:42,011 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:42,011 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 13:02:42,011 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:02:42,011 INFO  L87              Difference]: Start difference. First operand 816 states and 2412 transitions. Second operand 5 states.
[2020-10-16 13:02:42,042 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:42,043 INFO  L93              Difference]: Finished difference Result 930 states and 2647 transitions.
[2020-10-16 13:02:42,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:02:42,043 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 23
[2020-10-16 13:02:42,044 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:42,049 INFO  L225             Difference]: With dead ends: 930
[2020-10-16 13:02:42,049 INFO  L226             Difference]: Without dead ends: 822
[2020-10-16 13:02:42,050 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:02:42,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 822 states.
[2020-10-16 13:02:42,068 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 742.
[2020-10-16 13:02:42,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 742 states.
[2020-10-16 13:02:42,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2182 transitions.
[2020-10-16 13:02:42,072 INFO  L78                 Accepts]: Start accepts. Automaton has 742 states and 2182 transitions. Word has length 23
[2020-10-16 13:02:42,072 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:42,072 INFO  L481      AbstractCegarLoop]: Abstraction has 742 states and 2182 transitions.
[2020-10-16 13:02:42,072 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 13:02:42,072 INFO  L276                IsEmpty]: Start isEmpty. Operand 742 states and 2182 transitions.
[2020-10-16 13:02:42,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-16 13:02:42,075 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:42,075 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 13:02:42,075 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 13:02:42,075 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:42,075 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:42,075 INFO  L82        PathProgramCache]: Analyzing trace with hash 1416848711, now seen corresponding path program 2 times
[2020-10-16 13:02:42,077 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:42,077 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053980580]
[2020-10-16 13:02:42,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:42,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:42,202 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 13:02:42,202 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053980580]
[2020-10-16 13:02:42,203 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:42,203 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 13:02:42,203 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1762882829]
[2020-10-16 13:02:42,204 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:42,211 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:42,231 INFO  L258    McrAutomatonBuilder]: Finished intersection with 50 states and 76 transitions.
[2020-10-16 13:02:42,232 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:42,369 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [43990#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 13:02:42,369 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 13:02:42,370 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:42,370 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 13:02:42,370 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:02:42,370 INFO  L87              Difference]: Start difference. First operand 742 states and 2182 transitions. Second operand 8 states.
[2020-10-16 13:02:42,463 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:42,463 INFO  L93              Difference]: Finished difference Result 702 states and 2101 transitions.
[2020-10-16 13:02:42,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 13:02:42,464 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2020-10-16 13:02:42,464 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:42,467 INFO  L225             Difference]: With dead ends: 702
[2020-10-16 13:02:42,467 INFO  L226             Difference]: Without dead ends: 356
[2020-10-16 13:02:42,467 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132
[2020-10-16 13:02:42,469 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 356 states.
[2020-10-16 13:02:42,475 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356.
[2020-10-16 13:02:42,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 356 states.
[2020-10-16 13:02:42,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 989 transitions.
[2020-10-16 13:02:42,477 INFO  L78                 Accepts]: Start accepts. Automaton has 356 states and 989 transitions. Word has length 23
[2020-10-16 13:02:42,479 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:42,479 INFO  L481      AbstractCegarLoop]: Abstraction has 356 states and 989 transitions.
[2020-10-16 13:02:42,479 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 13:02:42,479 INFO  L276                IsEmpty]: Start isEmpty. Operand 356 states and 989 transitions.
[2020-10-16 13:02:42,480 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 13:02:42,480 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:42,481 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, 1]
[2020-10-16 13:02:42,481 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 13:02:42,481 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:42,481 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:42,481 INFO  L82        PathProgramCache]: Analyzing trace with hash 1597613711, now seen corresponding path program 1 times
[2020-10-16 13:02:42,483 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:42,483 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519461363]
[2020-10-16 13:02:42,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:42,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:42,581 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 13:02:42,581 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519461363]
[2020-10-16 13:02:42,581 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:42,582 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:02:42,582 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1284923961]
[2020-10-16 13:02:42,582 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:42,591 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:42,640 INFO  L258    McrAutomatonBuilder]: Finished intersection with 111 states and 224 transitions.
[2020-10-16 13:02:42,641 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:42,789 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:02:42,789 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:02:42,789 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:42,789 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:02:42,790 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:02:42,790 INFO  L87              Difference]: Start difference. First operand 356 states and 989 transitions. Second operand 4 states.
[2020-10-16 13:02:42,810 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:42,810 INFO  L93              Difference]: Finished difference Result 527 states and 1458 transitions.
[2020-10-16 13:02:42,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 13:02:42,810 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 27
[2020-10-16 13:02:42,811 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:42,812 INFO  L225             Difference]: With dead ends: 527
[2020-10-16 13:02:42,812 INFO  L226             Difference]: Without dead ends: 244
[2020-10-16 13:02:42,813 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 13:02:42,814 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 244 states.
[2020-10-16 13:02:42,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244.
[2020-10-16 13:02:42,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 244 states.
[2020-10-16 13:02:42,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 633 transitions.
[2020-10-16 13:02:42,819 INFO  L78                 Accepts]: Start accepts. Automaton has 244 states and 633 transitions. Word has length 27
[2020-10-16 13:02:42,820 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:42,820 INFO  L481      AbstractCegarLoop]: Abstraction has 244 states and 633 transitions.
[2020-10-16 13:02:42,820 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:02:42,820 INFO  L276                IsEmpty]: Start isEmpty. Operand 244 states and 633 transitions.
[2020-10-16 13:02:42,821 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 13:02:42,821 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:42,821 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, 1]
[2020-10-16 13:02:42,821 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 13:02:42,822 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:42,822 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:42,822 INFO  L82        PathProgramCache]: Analyzing trace with hash 288917433, now seen corresponding path program 2 times
[2020-10-16 13:02:42,823 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:42,823 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734192110]
[2020-10-16 13:02:42,823 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:42,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:02:43,017 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 13:02:43,017 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734192110]
[2020-10-16 13:02:43,017 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:02:43,017 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 13:02:43,018 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894891062]
[2020-10-16 13:02:43,018 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:02:43,026 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:02:43,086 INFO  L258    McrAutomatonBuilder]: Finished intersection with 113 states and 207 transitions.
[2020-10-16 13:02:43,086 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:02:43,293 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,294 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,297 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:02:43,297 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,298 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:43,299 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,299 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:43,299 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,303 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:43,303 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,304 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 13:02:43,304 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,308 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:43,308 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,310 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:02:43,310 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,311 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 13:02:43,312 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,312 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 13:02:43,313 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,316 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:43,324 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:02:43,330 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 7 conjuncts
[2020-10-16 13:02:43,349 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:02:43,386 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:02:43,443 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,498 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,499 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,501 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:02:43,501 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,502 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:02:43,503 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,504 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,504 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,505 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,505 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,509 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,512 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,518 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:43,519 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:02:43,521 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,525 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,526 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,527 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,533 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,539 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,544 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,547 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:02:43,552 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,553 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,553 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,559 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,564 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,568 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,572 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:02:43,572 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,696 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:02:43,697 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,697 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:43,697 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,698 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:43,698 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,699 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:02:43,699 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,700 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 13:02:43,701 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,701 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 13:02:43,702 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,703 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 13:02:43,703 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,704 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 13:02:43,705 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,705 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 13:02:43,705 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,707 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,707 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,709 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:43,711 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:02:43,714 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 7 conjuncts
[2020-10-16 13:02:43,723 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:02:43,747 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:02:43,791 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,837 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,838 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,840 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:02:43,840 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,841 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:02:43,841 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,842 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,843 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,843 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:02:43,844 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,848 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,849 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,852 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,855 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,860 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,863 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,865 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,874 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,875 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,877 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,881 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,882 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,887 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:43,893 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:02:43,897 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,898 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,901 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,904 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:43,908 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,911 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,917 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,918 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,920 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,924 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,925 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:43,930 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:02:43,930 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,002 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:02:44,002 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,003 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:44,003 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,004 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:44,004 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,007 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 5, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:44,007 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,008 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 13:02:44,009 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,009 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:02:44,009 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,010 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,011 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,013 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 13:02:44,014 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,014 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 13:02:44,015 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,016 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 13:02:44,016 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,018 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,020 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,025 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:02:44,036 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,051 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,087 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,087 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,089 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:02:44,089 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,090 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:02:44,090 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,091 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,092 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,100 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,102 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,102 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,107 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,108 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,112 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,113 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,116 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,117 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,117 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,123 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,127 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,130 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,134 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,136 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,137 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,138 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,143 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,148 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,151 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,153 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,154 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,162 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:02:44,162 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,189 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:02:44,189 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,190 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,191 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,196 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,196 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,205 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,206 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,213 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,214 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,215 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,215 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,223 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,256 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,268 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,269 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,273 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,276 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,283 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,315 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,325 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,336 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,349 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,350 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,351 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,353 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,417 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,456 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,471 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,472 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,477 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,485 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,489 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:02:44,489 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,644 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,646 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,647 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,649 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:02:44,649 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,651 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:02:44,651 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,653 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,654 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,654 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,660 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,661 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,662 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,666 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,671 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,677 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,682 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,686 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,687 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,693 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,697 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,700 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,702 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,703 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,707 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,707 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,708 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,711 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,715 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,719 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,722 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,725 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,726 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,731 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:44,735 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,738 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,740 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,743 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,744 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,745 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,749 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,750 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,755 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,756 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,765 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:02:44,766 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,783 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,785 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,786 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,787 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:02:44,788 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,789 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:02:44,789 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,790 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,791 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,791 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,793 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:44,795 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,797 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,797 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,800 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,800 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,804 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,813 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,816 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,818 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,831 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:02:44,831 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,854 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:02:44,855 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,856 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,858 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,861 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,863 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,868 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,868 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,874 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,875 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,876 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,876 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,880 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,909 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,925 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,925 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,929 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,931 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,937 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,962 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,970 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,978 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:44,985 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,986 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,987 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,987 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:44,991 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,020 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,034 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,035 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,039 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,045 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,049 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term
[2020-10-16 13:02:45,049 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:45,138 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:02:45,138 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:45,139 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:45,142 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:45,142 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:45,145 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,153 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:45,154 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:45,170 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,178 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,179 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,180 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,183 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,186 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,187 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:02:45,191 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,195 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:45,200 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,203 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:45,208 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,208 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,212 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:02:45,215 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,220 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:02:45,223 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,223 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,224 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,227 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,230 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,231 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:02:45,233 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,238 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:45,242 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,246 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:02:45,252 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,252 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,258 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:02:45,263 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term
[2020-10-16 13:02:45,264 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:02:45,282 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [46442#(and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y$w_buff0~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0))), 46443#(and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= (mod ~y$r_buff0_thd4~0 256) 0) (= ~y$w_buff0~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0))), 46444#(or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd4~0 0)), 46445#(and (= (mod ~y$r_buff0_thd4~0 256) 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$w_buff0~0 1) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd3~0 1))]
[2020-10-16 13:02:45,283 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-10-16 13:02:45,283 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:02:45,283 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-10-16 13:02:45,283 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2020-10-16 13:02:45,284 INFO  L87              Difference]: Start difference. First operand 244 states and 633 transitions. Second operand 12 states.
[2020-10-16 13:02:45,457 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:02:45,457 INFO  L93              Difference]: Finished difference Result 489 states and 1220 transitions.
[2020-10-16 13:02:45,457 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 13:02:45,457 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 27
[2020-10-16 13:02:45,458 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:02:45,460 INFO  L225             Difference]: With dead ends: 489
[2020-10-16 13:02:45,460 INFO  L226             Difference]: Without dead ends: 353
[2020-10-16 13:02:45,461 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2020-10-16 13:02:45,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 353 states.
[2020-10-16 13:02:45,467 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 244.
[2020-10-16 13:02:45,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 244 states.
[2020-10-16 13:02:45,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 599 transitions.
[2020-10-16 13:02:45,468 INFO  L78                 Accepts]: Start accepts. Automaton has 244 states and 599 transitions. Word has length 27
[2020-10-16 13:02:45,468 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:02:45,468 INFO  L481      AbstractCegarLoop]: Abstraction has 244 states and 599 transitions.
[2020-10-16 13:02:45,468 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-10-16 13:02:45,469 INFO  L276                IsEmpty]: Start isEmpty. Operand 244 states and 599 transitions.
[2020-10-16 13:02:45,471 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 13:02:45,471 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:02:45,471 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, 1]
[2020-10-16 13:02:45,471 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 13:02:45,472 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:02:45,472 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:02:45,472 INFO  L82        PathProgramCache]: Analyzing trace with hash 1198055219, now seen corresponding path program 3 times
[2020-10-16 13:02:45,473 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:02:45,474 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143088415]
[2020-10-16 13:02:45,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:02:45,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:02:45,555 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:02:45,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:02:45,615 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:02:45,673 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 13:02:45,674 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 13:02:45,674 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 13:02:45,721 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 13:02:45,721 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,723 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 13:02:45,723 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,723 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 13:02:45,723 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,723 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 13:02:45,723 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,723 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 13:02:45,724 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,724 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 13:02:45,724 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,726 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 13:02:45,726 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,727 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 13:02:45,727 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,727 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 13:02:45,727 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,727 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 13:02:45,727 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,727 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 13:02:45,728 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,728 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 13:02:45,728 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,728 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 13:02:45,728 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,728 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 13:02:45,728 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,729 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 13:02:45,729 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,729 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 13:02:45,729 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,733 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 13:02:45,733 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,734 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 13:02:45,734 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,734 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 13:02:45,734 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,735 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 13:02:45,735 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,735 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 13:02:45,735 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,736 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 13:02:45,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,736 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 13:02:45,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,736 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 13:02:45,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,738 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 13:02:45,738 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,738 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 13:02:45,738 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,738 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 13:02:45,738 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,738 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 13:02:45,739 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,739 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 13:02:45,739 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:02:45,847 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:02:45 BasicIcfg
[2020-10-16 13:02:45,847 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 13:02:45,849 INFO  L168              Benchmark]: Toolchain (without parser) took 13806.36 ms. Allocated memory was 147.3 MB in the beginning and 462.9 MB in the end (delta: 315.6 MB). Free memory was 101.9 MB in the beginning and 94.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 323.1 MB. Max. memory is 7.1 GB.
[2020-10-16 13:02:45,850 INFO  L168              Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-16 13:02:45,851 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 776.65 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 101.7 MB in the beginning and 157.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB.
[2020-10-16 13:02:45,851 INFO  L168              Benchmark]: Boogie Procedure Inliner took 68.28 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
[2020-10-16 13:02:45,853 INFO  L168              Benchmark]: Boogie Preprocessor took 37.92 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
[2020-10-16 13:02:45,855 INFO  L168              Benchmark]: RCFGBuilder took 1967.88 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 152.1 MB in the beginning and 186.2 MB in the end (delta: -34.1 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB.
[2020-10-16 13:02:45,858 INFO  L168              Benchmark]: TraceAbstraction took 10950.05 ms. Allocated memory was 246.9 MB in the beginning and 462.9 MB in the end (delta: 216.0 MB). Free memory was 186.2 MB in the beginning and 94.4 MB in the end (delta: 91.8 MB). Peak memory consumption was 307.8 MB. Max. memory is 7.1 GB.
[2020-10-16 13:02:45,870 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.18 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 776.65 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 101.7 MB in the beginning and 157.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 68.28 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 37.92 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1967.88 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 152.1 MB in the beginning and 186.2 MB in the end (delta: -34.1 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 10950.05 ms. Allocated memory was 246.9 MB in the beginning and 462.9 MB in the end (delta: 216.0 MB). Free memory was 186.2 MB in the beginning and 94.4 MB in the end (delta: 91.8 MB). Peak memory consumption was 307.8 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1195 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 92 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.9s, 121 PlacesBefore, 47 PlacesAfterwards, 110 TransitionsBefore, 35 TransitionsAfterwards, 2456 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 7666 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_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L708]               0  _Bool main$tmp_guard0;
[L709]               0  _Bool main$tmp_guard1;
[L711]               0  int x = 0;
[L713]               0  int y = 0;
[L714]               0  _Bool y$flush_delayed;
[L715]               0  int y$mem_tmp;
[L716]               0  _Bool y$r_buff0_thd0;
[L717]               0  _Bool y$r_buff0_thd1;
[L718]               0  _Bool y$r_buff0_thd2;
[L719]               0  _Bool y$r_buff0_thd3;
[L720]               0  _Bool y$r_buff0_thd4;
[L721]               0  _Bool y$r_buff1_thd0;
[L722]               0  _Bool y$r_buff1_thd1;
[L723]               0  _Bool y$r_buff1_thd2;
[L724]               0  _Bool y$r_buff1_thd3;
[L725]               0  _Bool y$r_buff1_thd4;
[L726]               0  _Bool y$read_delayed;
[L727]               0  int *y$read_delayed_var;
[L728]               0  int y$w_buff0;
[L729]               0  _Bool y$w_buff0_used;
[L730]               0  int y$w_buff1;
[L731]               0  _Bool y$w_buff1_used;
[L733]               0  int z = 0;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L843]               0  pthread_t t725;
[L844]  FCALL, FORK  0  pthread_create(&t725, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L845]               0  pthread_t t726;
[L846]  FCALL, FORK  0  pthread_create(&t726, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L847]               0  pthread_t t727;
[L848]  FCALL, FORK  0  pthread_create(&t727, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L849]               0  pthread_t t728;
[L782]               3  y$w_buff1 = y$w_buff0
[L783]               3  y$w_buff0 = 1
[L784]               3  y$w_buff1_used = y$w_buff0_used
[L785]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L787]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L788]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L789]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L790]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L791]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L792]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L850]  FCALL, FORK  0  pthread_create(&t728, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L795]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L812]               4  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L815]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L818]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L821]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L821]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L822]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L822]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L823]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L823]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L824]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L824]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L825]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L825]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L828]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L830]               4  return 0;
[L739]               1  a = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L742]               1  x = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L747]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L749]               1  return 0;
[L754]               2  x = 2
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L757]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L758]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L759]               2  y$flush_delayed = weak$$choice2
[L760]               2  y$mem_tmp = y
[L761]  EXPR         2  !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L761]               2  y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L762]  EXPR         2  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L762]  EXPR         2  !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)
[L762]  EXPR         2  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L762]               2  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L763]  EXPR         2  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L763]  EXPR         2  !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)
[L763]  EXPR         2  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L763]               2  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L764]  EXPR         2  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L764]  EXPR         2  !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)
[L764]  EXPR         2  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L764]               2  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L765]  EXPR         2  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L765]               2  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L766]  EXPR         2  weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L766]  EXPR         2  !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)
[L766]  EXPR         2  weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L766]               2  y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L767]  EXPR         2  weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L767]  EXPR         2  !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L767]  EXPR         2  weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L767]               2  y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L768]               2  __unbuffered_p1_EAX = y
[L769]  EXPR         2  y$flush_delayed ? y$mem_tmp : y
[L769]               2  y = y$flush_delayed ? y$mem_tmp : y
[L770]               2  y$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L775]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L777]               2  return 0;
[L798]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L798]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L799]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L799]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L800]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L800]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L801]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L801]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L802]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L802]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L805]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L807]               3  return 0;
[L852]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L3]    COND FALSE   0  !(!cond)
[L856]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L856]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L857]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L857]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L858]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L858]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L859]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L859]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L860]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L860]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L863]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __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_p3_EAX=2, __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=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 374 SDtfs, 628 SDslu, 1010 SDs, 0 SdLazy, 307 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 228 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4266occurred 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.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 241 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 14649 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...