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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:05:33,702 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:05:33,706 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:05:33,747 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:05:33,748 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:05:33,756 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:05:33,758 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:05:33,760 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:05:33,763 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:05:33,766 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:05:33,767 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:05:33,769 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:05:33,769 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:05:33,772 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:05:33,774 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:05:33,775 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:05:33,777 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:05:33,778 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:05:33,779 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:05:33,787 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:05:33,789 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:05:33,790 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:05:33,791 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:05:33,792 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:05:33,804 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:05:33,804 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:05:33,805 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:05:33,807 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:05:33,808 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:05:33,809 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:05:33,809 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:05:33,809 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:05:33,812 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:05:33,813 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:05:33,814 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:05:33,814 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:05:33,814 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:05:33,815 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:05:33,815 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:05:33,816 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:05:33,817 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:05:33,818 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:05:33,857 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:05:33,858 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:05:33,859 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:05:33,859 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:05:33,860 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:05:33,860 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:05:33,860 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:05:33,860 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:05:33,860 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:05:33,861 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:05:33,861 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:05:33,862 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:05:33,862 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:05:33,862 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:05:33,863 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:05:33,863 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:05:33,863 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:05:33,863 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:05:33,863 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:05:33,863 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:05:33,864 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:05:33,864 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:05:33,864 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:05:33,864 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:05:33,864 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:05:33,865 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:05:33,865 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:05:33,865 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:05:33,865 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-16 11:05:33,865 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:05:34,131 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:05:34,146 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:05:34,150 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:05:34,151 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 11:05:34,153 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 11:05:34,154 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i
[2020-10-16 11:05:34,217 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5c079f0c1/7b56e16721d241479f3469100ff170b2/FLAG9f57bc721
[2020-10-16 11:05:34,672 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 11:05:34,673 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i
[2020-10-16 11:05:34,689 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5c079f0c1/7b56e16721d241479f3469100ff170b2/FLAG9f57bc721
[2020-10-16 11:05:34,986 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5c079f0c1/7b56e16721d241479f3469100ff170b2
[2020-10-16 11:05:34,994 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:05:34,996 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:05:34,997 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:05:34,997 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:05:35,001 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:05:35,003 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:05:34" (1/1) ...
[2020-10-16 11:05:35,006 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b05ae09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35, skipping insertion in model container
[2020-10-16 11:05:35,006 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:05:34" (1/1) ...
[2020-10-16 11:05:35,014 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 11:05:35,059 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:05:35,542 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:05:35,556 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 11:05:35,638 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:05:35,712 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 11:05:35,712 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35 WrapperNode
[2020-10-16 11:05:35,713 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:05:35,713 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:05:35,714 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:05:35,714 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:05:35,723 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
[2020-10-16 11:05:35,745 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
[2020-10-16 11:05:35,780 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:05:35,780 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:05:35,780 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:05:35,780 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:05:35,791 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
[2020-10-16 11:05:35,791 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
[2020-10-16 11:05:35,797 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
[2020-10-16 11:05:35,798 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
[2020-10-16 11:05:35,809 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
[2020-10-16 11:05:35,815 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
[2020-10-16 11:05:35,820 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
[2020-10-16 11:05:35,826 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:05:35,827 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:05:35,827 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:05:35,828 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:05:35,829 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:05:35,922 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:05:35,922 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:05:35,922 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:05:35,923 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:05:35,923 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:05:35,924 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:05:35,924 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:05:35,925 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:05:35,925 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:05:35,926 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:05:35,926 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:05:35,926 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:05:35,926 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:05:35,929 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 11:05:38,190 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:05:38,190 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:05:38,192 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:05:38 BoogieIcfgContainer
[2020-10-16 11:05:38,193 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:05:38,194 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:05:38,194 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:05:38,197 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:05:38,198 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:05:34" (1/3) ...
[2020-10-16 11:05:38,199 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5007720c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:05:38, skipping insertion in model container
[2020-10-16 11:05:38,199 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:05:35" (2/3) ...
[2020-10-16 11:05:38,200 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5007720c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:05:38, skipping insertion in model container
[2020-10-16 11:05:38,200 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:05:38" (3/3) ...
[2020-10-16 11:05:38,202 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix003_tso.oepc.i
[2020-10-16 11:05:38,213 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:05:38,214 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:05:38,222 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:05:38,223 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:05:38,255 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,255 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,256 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,256 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,256 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,257 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,257 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,258 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,258 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,258 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,258 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,258 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,259 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,259 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,259 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,260 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,260 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,260 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,261 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,262 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,263 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,264 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,264 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,266 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,267 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,267 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,267 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,267 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,267 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,267 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,268 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,269 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,270 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,270 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,270 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,270 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,270 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,272 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,272 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,272 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,273 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,273 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,273 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,273 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,273 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,274 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,278 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,278 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,278 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,279 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,279 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,279 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,279 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,279 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,280 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,281 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,281 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,282 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,282 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,282 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,282 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,282 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,283 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,284 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,286 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,287 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,287 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,287 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,287 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,288 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,288 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,288 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,289 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,290 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,290 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,291 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,291 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,291 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,291 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,291 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,291 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,292 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,292 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:05:38,293 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:05:38,307 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 11:05:38,329 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:05:38,329 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 11:05:38,329 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:05:38,329 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:05:38,330 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:05:38,330 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 11:05:38,330 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:05:38,330 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:05:38,344 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:05:38,347 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 211 flow
[2020-10-16 11:05:38,350 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 211 flow
[2020-10-16 11:05:38,352 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow
[2020-10-16 11:05:38,400 INFO  L129       PetriNetUnfolder]: 2/95 cut-off events.
[2020-10-16 11:05:38,400 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:05:38,405 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. 
[2020-10-16 11:05:38,409 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1824
[2020-10-16 11:05:38,523 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:38,524 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:38,526 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:38,527 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:38,531 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:38,531 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:38,535 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:38,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:38,560 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:38,561 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:38,562 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:38,562 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:38,566 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:38,566 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:38,569 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:38,570 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,058 WARN  L193               SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:05:39,205 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,206 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,207 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,207 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,211 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,211 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,214 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,215 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,235 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,236 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,237 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,237 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,241 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,241 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,244 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,244 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,294 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,295 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,298 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,298 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,301 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,302 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,322 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,322 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,323 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,324 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,326 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,327 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,329 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,330 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,357 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,357 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,358 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,359 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,361 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,362 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,364 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,364 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,383 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,383 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,384 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,384 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,387 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,387 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,389 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,390 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,536 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,537 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,538 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,539 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,541 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,541 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,544 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,544 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,563 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,563 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,564 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,564 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:39,587 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:39,588 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:39,589 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:39,590 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:40,110 WARN  L193               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:05:40,219 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:40,219 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,220 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,221 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,223 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,224 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:40,227 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:40,228 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:40,249 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:40,249 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,250 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,250 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,253 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,254 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:40,255 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:40,256 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:40,498 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:05:40,499 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,542 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:05:40,543 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,702 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,703 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,704 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,707 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,709 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,711 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:40,713 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:40,714 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:40,725 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,726 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,726 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,727 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,728 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,729 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:40,730 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:40,731 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:40,829 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,829 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,830 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,831 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,833 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,834 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:40,835 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:40,836 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:05:40,851 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,851 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,852 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,852 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:40,854 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:40,855 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:40,856 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:40,857 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,036 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,036 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,037 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,037 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,039 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,040 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,057 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,058 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,059 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,059 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,061 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,061 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,063 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,063 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,186 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,187 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,187 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,188 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,189 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,190 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,192 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,192 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,208 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,209 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,209 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,210 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,212 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,212 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,215 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,216 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,245 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,246 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,247 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,247 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,249 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,249 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,252 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,253 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,267 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,267 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,268 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,268 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,271 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,271 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,278 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,279 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,413 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:05:41,413 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,455 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,455 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,456 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,458 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,487 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,488 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,510 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,511 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,511 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,512 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:05:41,514 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:05:41,514 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,516 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:05:41,516 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:05:41,784 WARN  L193               SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93
[2020-10-16 11:05:41,907 WARN  L193               SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 91
[2020-10-16 11:05:41,916 INFO  L132        LiptonReduction]: Checked pairs total: 5618
[2020-10-16 11:05:41,917 INFO  L134        LiptonReduction]: Total number of compositions: 80
[2020-10-16 11:05:41,924 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow
[2020-10-16 11:05:42,019 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1382 states.
[2020-10-16 11:05:42,022 INFO  L276                IsEmpty]: Start isEmpty. Operand 1382 states.
[2020-10-16 11:05:42,027 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-16 11:05:42,028 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:42,029 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-16 11:05:42,029 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:42,035 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:42,035 INFO  L82        PathProgramCache]: Analyzing trace with hash 1058926, now seen corresponding path program 1 times
[2020-10-16 11:05:42,045 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:42,046 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161815467]
[2020-10-16 11:05:42,046 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:42,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:42,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:42,266 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161815467]
[2020-10-16 11:05:42,267 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:42,267 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:05:42,267 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820252385]
[2020-10-16 11:05:42,272 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:05:42,272 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:42,287 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:05:42,288 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:42,290 INFO  L87              Difference]: Start difference. First operand 1382 states. Second operand 3 states.
[2020-10-16 11:05:42,411 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:42,412 INFO  L93              Difference]: Finished difference Result 1152 states and 3742 transitions.
[2020-10-16 11:05:42,413 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:05:42,415 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-16 11:05:42,415 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:42,452 INFO  L225             Difference]: With dead ends: 1152
[2020-10-16 11:05:42,452 INFO  L226             Difference]: Without dead ends: 972
[2020-10-16 11:05:42,453 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:05:42,484 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 972 states.
[2020-10-16 11:05:42,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972.
[2020-10-16 11:05:42,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 972 states.
[2020-10-16 11:05:42,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3118 transitions.
[2020-10-16 11:05:42,616 INFO  L78                 Accepts]: Start accepts. Automaton has 972 states and 3118 transitions. Word has length 3
[2020-10-16 11:05:42,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:42,616 INFO  L481      AbstractCegarLoop]: Abstraction has 972 states and 3118 transitions.
[2020-10-16 11:05:42,616 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:05:42,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 972 states and 3118 transitions.
[2020-10-16 11:05:42,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 11:05:42,619 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:42,619 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:42,620 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:05:42,620 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:42,621 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:42,621 INFO  L82        PathProgramCache]: Analyzing trace with hash -110156330, now seen corresponding path program 1 times
[2020-10-16 11:05:42,621 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:42,622 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797642542]
[2020-10-16 11:05:42,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:42,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:42,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:42,822 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797642542]
[2020-10-16 11:05:42,822 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:42,822 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:05:42,823 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793732843]
[2020-10-16 11:05:42,824 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:42,824 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:42,825 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:42,825 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:42,825 INFO  L87              Difference]: Start difference. First operand 972 states and 3118 transitions. Second operand 4 states.
[2020-10-16 11:05:42,867 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:42,867 INFO  L93              Difference]: Finished difference Result 1032 states and 3186 transitions.
[2020-10-16 11:05:42,868 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:05:42,868 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-16 11:05:42,868 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:42,876 INFO  L225             Difference]: With dead ends: 1032
[2020-10-16 11:05:42,876 INFO  L226             Difference]: Without dead ends: 852
[2020-10-16 11:05:42,877 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 11:05:42,882 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 852 states.
[2020-10-16 11:05:42,909 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852.
[2020-10-16 11:05:42,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 852 states.
[2020-10-16 11:05:42,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2682 transitions.
[2020-10-16 11:05:42,914 INFO  L78                 Accepts]: Start accepts. Automaton has 852 states and 2682 transitions. Word has length 10
[2020-10-16 11:05:42,915 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:42,916 INFO  L481      AbstractCegarLoop]: Abstraction has 852 states and 2682 transitions.
[2020-10-16 11:05:42,916 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:42,916 INFO  L276                IsEmpty]: Start isEmpty. Operand 852 states and 2682 transitions.
[2020-10-16 11:05:42,919 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:05:42,919 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:42,919 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:42,919 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:05:42,920 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:42,920 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:42,920 INFO  L82        PathProgramCache]: Analyzing trace with hash 1515810141, now seen corresponding path program 1 times
[2020-10-16 11:05:42,920 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:42,921 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172123170]
[2020-10-16 11:05:42,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:42,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:43,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:43,023 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172123170]
[2020-10-16 11:05:43,023 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:43,023 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:05:43,024 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514106059]
[2020-10-16 11:05:43,024 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:43,024 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:43,025 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:43,025 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:43,025 INFO  L87              Difference]: Start difference. First operand 852 states and 2682 transitions. Second operand 4 states.
[2020-10-16 11:05:43,065 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:43,065 INFO  L93              Difference]: Finished difference Result 892 states and 2724 transitions.
[2020-10-16 11:05:43,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:05:43,066 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-16 11:05:43,066 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:43,073 INFO  L225             Difference]: With dead ends: 892
[2020-10-16 11:05:43,073 INFO  L226             Difference]: Without dead ends: 772
[2020-10-16 11:05:43,074 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 11:05:43,077 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 772 states.
[2020-10-16 11:05:43,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772.
[2020-10-16 11:05:43,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 772 states.
[2020-10-16 11:05:43,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2398 transitions.
[2020-10-16 11:05:43,104 INFO  L78                 Accepts]: Start accepts. Automaton has 772 states and 2398 transitions. Word has length 12
[2020-10-16 11:05:43,105 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:43,105 INFO  L481      AbstractCegarLoop]: Abstraction has 772 states and 2398 transitions.
[2020-10-16 11:05:43,105 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:43,105 INFO  L276                IsEmpty]: Start isEmpty. Operand 772 states and 2398 transitions.
[2020-10-16 11:05:43,108 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:05:43,109 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:43,109 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:43,109 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:05:43,109 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:43,110 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:43,110 INFO  L82        PathProgramCache]: Analyzing trace with hash 1123542125, now seen corresponding path program 1 times
[2020-10-16 11:05:43,110 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:43,111 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672772269]
[2020-10-16 11:05:43,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:43,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:43,234 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:43,235 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672772269]
[2020-10-16 11:05:43,235 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:43,235 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:05:43,236 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681801795]
[2020-10-16 11:05:43,236 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:05:43,236 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:43,236 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:05:43,237 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:05:43,238 INFO  L87              Difference]: Start difference. First operand 772 states and 2398 transitions. Second operand 4 states.
[2020-10-16 11:05:43,320 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:43,323 INFO  L93              Difference]: Finished difference Result 680 states and 1854 transitions.
[2020-10-16 11:05:43,323 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:05:43,324 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 11:05:43,324 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:43,327 INFO  L225             Difference]: With dead ends: 680
[2020-10-16 11:05:43,328 INFO  L226             Difference]: Without dead ends: 500
[2020-10-16 11:05:43,328 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:05:43,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 500 states.
[2020-10-16 11:05:43,340 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500.
[2020-10-16 11:05:43,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 500 states.
[2020-10-16 11:05:43,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1310 transitions.
[2020-10-16 11:05:43,343 INFO  L78                 Accepts]: Start accepts. Automaton has 500 states and 1310 transitions. Word has length 14
[2020-10-16 11:05:43,343 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:43,343 INFO  L481      AbstractCegarLoop]: Abstraction has 500 states and 1310 transitions.
[2020-10-16 11:05:43,343 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:05:43,343 INFO  L276                IsEmpty]: Start isEmpty. Operand 500 states and 1310 transitions.
[2020-10-16 11:05:43,345 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:05:43,345 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:43,345 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:05:43,345 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:05:43,345 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:43,345 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:43,346 INFO  L82        PathProgramCache]: Analyzing trace with hash -519398262, now seen corresponding path program 1 times
[2020-10-16 11:05:43,346 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:43,346 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445749875]
[2020-10-16 11:05:43,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:43,404 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:43,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:43,456 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445749875]
[2020-10-16 11:05:43,456 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:43,456 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:05:43,456 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725579634]
[2020-10-16 11:05:43,457 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:05:43,457 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:43,457 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:05:43,457 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:05:43,458 INFO  L87              Difference]: Start difference. First operand 500 states and 1310 transitions. Second operand 5 states.
[2020-10-16 11:05:43,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:43,504 INFO  L93              Difference]: Finished difference Result 384 states and 931 transitions.
[2020-10-16 11:05:43,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:05:43,504 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-16 11:05:43,504 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:43,506 INFO  L225             Difference]: With dead ends: 384
[2020-10-16 11:05:43,506 INFO  L226             Difference]: Without dead ends: 304
[2020-10-16 11:05:43,507 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:05:43,508 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 304 states.
[2020-10-16 11:05:43,513 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304.
[2020-10-16 11:05:43,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 304 states.
[2020-10-16 11:05:43,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 722 transitions.
[2020-10-16 11:05:43,515 INFO  L78                 Accepts]: Start accepts. Automaton has 304 states and 722 transitions. Word has length 17
[2020-10-16 11:05:43,515 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:43,515 INFO  L481      AbstractCegarLoop]: Abstraction has 304 states and 722 transitions.
[2020-10-16 11:05:43,515 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:05:43,515 INFO  L276                IsEmpty]: Start isEmpty. Operand 304 states and 722 transitions.
[2020-10-16 11:05:43,516 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:05:43,516 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:43,517 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 11:05:43,517 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:05:43,517 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:43,517 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:43,517 INFO  L82        PathProgramCache]: Analyzing trace with hash 661320952, now seen corresponding path program 1 times
[2020-10-16 11:05:43,518 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:43,518 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109858934]
[2020-10-16 11:05:43,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:43,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:43,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:43,685 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109858934]
[2020-10-16 11:05:43,685 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:43,686 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 11:05:43,686 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859348792]
[2020-10-16 11:05:43,686 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 11:05:43,686 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:43,687 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 11:05:43,687 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:05:43,687 INFO  L87              Difference]: Start difference. First operand 304 states and 722 transitions. Second operand 9 states.
[2020-10-16 11:05:43,815 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:43,815 INFO  L93              Difference]: Finished difference Result 411 states and 953 transitions.
[2020-10-16 11:05:43,815 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-10-16 11:05:43,816 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 20
[2020-10-16 11:05:43,816 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:43,818 INFO  L225             Difference]: With dead ends: 411
[2020-10-16 11:05:43,818 INFO  L226             Difference]: Without dead ends: 304
[2020-10-16 11:05:43,818 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2020-10-16 11:05:43,820 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 304 states.
[2020-10-16 11:05:43,825 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304.
[2020-10-16 11:05:43,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 304 states.
[2020-10-16 11:05:43,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 706 transitions.
[2020-10-16 11:05:43,827 INFO  L78                 Accepts]: Start accepts. Automaton has 304 states and 706 transitions. Word has length 20
[2020-10-16 11:05:43,827 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:43,827 INFO  L481      AbstractCegarLoop]: Abstraction has 304 states and 706 transitions.
[2020-10-16 11:05:43,827 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 11:05:43,827 INFO  L276                IsEmpty]: Start isEmpty. Operand 304 states and 706 transitions.
[2020-10-16 11:05:43,828 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:05:43,828 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:43,829 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 11:05:43,829 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:05:43,829 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:43,829 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:43,830 INFO  L82        PathProgramCache]: Analyzing trace with hash 421678614, now seen corresponding path program 2 times
[2020-10-16 11:05:43,830 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:43,830 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110008277]
[2020-10-16 11:05:43,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:43,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:43,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:43,974 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110008277]
[2020-10-16 11:05:43,975 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:43,975 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 11:05:43,975 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497444559]
[2020-10-16 11:05:43,976 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 11:05:43,976 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:43,976 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 11:05:43,976 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:05:43,977 INFO  L87              Difference]: Start difference. First operand 304 states and 706 transitions. Second operand 9 states.
[2020-10-16 11:05:44,136 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:44,136 INFO  L93              Difference]: Finished difference Result 399 states and 881 transitions.
[2020-10-16 11:05:44,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-10-16 11:05:44,137 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 20
[2020-10-16 11:05:44,138 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:44,141 INFO  L225             Difference]: With dead ends: 399
[2020-10-16 11:05:44,141 INFO  L226             Difference]: Without dead ends: 340
[2020-10-16 11:05:44,142 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2020-10-16 11:05:44,144 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 340 states.
[2020-10-16 11:05:44,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 316.
[2020-10-16 11:05:44,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 316 states.
[2020-10-16 11:05:44,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 722 transitions.
[2020-10-16 11:05:44,157 INFO  L78                 Accepts]: Start accepts. Automaton has 316 states and 722 transitions. Word has length 20
[2020-10-16 11:05:44,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:44,157 INFO  L481      AbstractCegarLoop]: Abstraction has 316 states and 722 transitions.
[2020-10-16 11:05:44,158 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 11:05:44,158 INFO  L276                IsEmpty]: Start isEmpty. Operand 316 states and 722 transitions.
[2020-10-16 11:05:44,159 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:05:44,160 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:44,160 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 11:05:44,160 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:05:44,160 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:44,161 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:44,161 INFO  L82        PathProgramCache]: Analyzing trace with hash -639077976, now seen corresponding path program 3 times
[2020-10-16 11:05:44,161 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:44,162 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258525634]
[2020-10-16 11:05:44,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:44,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:44,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:44,268 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258525634]
[2020-10-16 11:05:44,268 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:44,269 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:05:44,269 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582101296]
[2020-10-16 11:05:44,270 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:05:44,270 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:44,270 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:05:44,270 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:05:44,271 INFO  L87              Difference]: Start difference. First operand 316 states and 722 transitions. Second operand 6 states.
[2020-10-16 11:05:44,336 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:44,336 INFO  L93              Difference]: Finished difference Result 283 states and 654 transitions.
[2020-10-16 11:05:44,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:05:44,337 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2020-10-16 11:05:44,337 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:44,339 INFO  L225             Difference]: With dead ends: 283
[2020-10-16 11:05:44,339 INFO  L226             Difference]: Without dead ends: 268
[2020-10-16 11:05:44,340 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:05:44,341 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 268 states.
[2020-10-16 11:05:44,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268.
[2020-10-16 11:05:44,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 268 states.
[2020-10-16 11:05:44,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 626 transitions.
[2020-10-16 11:05:44,351 INFO  L78                 Accepts]: Start accepts. Automaton has 268 states and 626 transitions. Word has length 20
[2020-10-16 11:05:44,351 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:44,351 INFO  L481      AbstractCegarLoop]: Abstraction has 268 states and 626 transitions.
[2020-10-16 11:05:44,351 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:05:44,352 INFO  L276                IsEmpty]: Start isEmpty. Operand 268 states and 626 transitions.
[2020-10-16 11:05:44,353 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 11:05:44,353 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:44,354 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]
[2020-10-16 11:05:44,354 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:05:44,354 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:44,355 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:44,355 INFO  L82        PathProgramCache]: Analyzing trace with hash -203411009, now seen corresponding path program 1 times
[2020-10-16 11:05:44,355 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:44,356 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214747766]
[2020-10-16 11:05:44,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:44,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:44,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:44,516 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214747766]
[2020-10-16 11:05:44,516 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:44,516 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:05:44,516 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957477846]
[2020-10-16 11:05:44,517 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:05:44,517 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:44,517 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:05:44,517 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:05:44,518 INFO  L87              Difference]: Start difference. First operand 268 states and 626 transitions. Second operand 6 states.
[2020-10-16 11:05:44,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:44,703 INFO  L93              Difference]: Finished difference Result 342 states and 785 transitions.
[2020-10-16 11:05:44,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:05:44,703 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 24
[2020-10-16 11:05:44,704 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:44,705 INFO  L225             Difference]: With dead ends: 342
[2020-10-16 11:05:44,705 INFO  L226             Difference]: Without dead ends: 219
[2020-10-16 11:05:44,706 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:05:44,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 219 states.
[2020-10-16 11:05:44,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 181.
[2020-10-16 11:05:44,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 181 states.
[2020-10-16 11:05:44,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 416 transitions.
[2020-10-16 11:05:44,713 INFO  L78                 Accepts]: Start accepts. Automaton has 181 states and 416 transitions. Word has length 24
[2020-10-16 11:05:44,716 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:44,716 INFO  L481      AbstractCegarLoop]: Abstraction has 181 states and 416 transitions.
[2020-10-16 11:05:44,716 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:05:44,716 INFO  L276                IsEmpty]: Start isEmpty. Operand 181 states and 416 transitions.
[2020-10-16 11:05:44,717 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 11:05:44,717 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:44,717 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]
[2020-10-16 11:05:44,717 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:05:44,718 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:44,718 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:44,718 INFO  L82        PathProgramCache]: Analyzing trace with hash -1503809937, now seen corresponding path program 2 times
[2020-10-16 11:05:44,718 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:44,719 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677801943]
[2020-10-16 11:05:44,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:44,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:44,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:44,953 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677801943]
[2020-10-16 11:05:44,954 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:44,954 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:05:44,954 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983525900]
[2020-10-16 11:05:44,954 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:05:44,955 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:44,955 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:05:44,955 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:05:44,955 INFO  L87              Difference]: Start difference. First operand 181 states and 416 transitions. Second operand 7 states.
[2020-10-16 11:05:45,140 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:45,140 INFO  L93              Difference]: Finished difference Result 280 states and 612 transitions.
[2020-10-16 11:05:45,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 11:05:45,141 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-10-16 11:05:45,141 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:45,143 INFO  L225             Difference]: With dead ends: 280
[2020-10-16 11:05:45,143 INFO  L226             Difference]: Without dead ends: 226
[2020-10-16 11:05:45,143 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2020-10-16 11:05:45,144 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2020-10-16 11:05:45,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 201.
[2020-10-16 11:05:45,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 201 states.
[2020-10-16 11:05:45,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 454 transitions.
[2020-10-16 11:05:45,149 INFO  L78                 Accepts]: Start accepts. Automaton has 201 states and 454 transitions. Word has length 24
[2020-10-16 11:05:45,150 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:45,150 INFO  L481      AbstractCegarLoop]: Abstraction has 201 states and 454 transitions.
[2020-10-16 11:05:45,150 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:05:45,150 INFO  L276                IsEmpty]: Start isEmpty. Operand 201 states and 454 transitions.
[2020-10-16 11:05:45,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 11:05:45,151 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:45,151 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]
[2020-10-16 11:05:45,151 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:05:45,151 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:45,152 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:45,152 INFO  L82        PathProgramCache]: Analyzing trace with hash 441676831, now seen corresponding path program 3 times
[2020-10-16 11:05:45,152 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:45,152 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421092589]
[2020-10-16 11:05:45,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:45,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:05:45,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:05:45,402 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421092589]
[2020-10-16 11:05:45,403 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:05:45,403 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 11:05:45,403 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812051229]
[2020-10-16 11:05:45,403 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 11:05:45,404 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:05:45,404 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 11:05:45,404 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:05:45,404 INFO  L87              Difference]: Start difference. First operand 201 states and 454 transitions. Second operand 8 states.
[2020-10-16 11:05:45,629 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:05:45,629 INFO  L93              Difference]: Finished difference Result 216 states and 477 transitions.
[2020-10-16 11:05:45,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 11:05:45,630 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 24
[2020-10-16 11:05:45,630 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:05:45,631 INFO  L225             Difference]: With dead ends: 216
[2020-10-16 11:05:45,631 INFO  L226             Difference]: Without dead ends: 149
[2020-10-16 11:05:45,632 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2020-10-16 11:05:45,632 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2020-10-16 11:05:45,635 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129.
[2020-10-16 11:05:45,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2020-10-16 11:05:45,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 280 transitions.
[2020-10-16 11:05:45,636 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 280 transitions. Word has length 24
[2020-10-16 11:05:45,636 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:05:45,636 INFO  L481      AbstractCegarLoop]: Abstraction has 129 states and 280 transitions.
[2020-10-16 11:05:45,636 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 11:05:45,637 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 280 transitions.
[2020-10-16 11:05:45,638 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 11:05:45,638 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:05:45,638 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]
[2020-10-16 11:05:45,639 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:05:45,639 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:05:45,639 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:05:45,639 INFO  L82        PathProgramCache]: Analyzing trace with hash 1433294287, now seen corresponding path program 4 times
[2020-10-16 11:05:45,640 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:05:45,640 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825740240]
[2020-10-16 11:05:45,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:05:45,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:05:45,701 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:05:45,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:05:45,748 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:05:45,803 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:05:45,803 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:05:45,804 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 11:05:45,830 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,830 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,838 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,838 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,839 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,839 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,839 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,839 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,839 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,839 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,840 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,840 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,840 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,840 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,841 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,841 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,841 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,841 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,842 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,842 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,842 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,842 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,843 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,843 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,843 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,843 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,843 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,843 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,844 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,844 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,844 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,844 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,844 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,845 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,851 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,851 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,851 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,851 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,851 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,851 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,852 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,852 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,853 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,853 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,853 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,853 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,853 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,853 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,853 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,854 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,854 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,854 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,854 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,854 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,855 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,855 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,856 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,856 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,856 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,856 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,856 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,856 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,857 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,857 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,857 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:05:45,857 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:05:45,958 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:05:45 BasicIcfg
[2020-10-16 11:05:45,958 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:05:45,960 INFO  L168              Benchmark]: Toolchain (without parser) took 10964.49 ms. Allocated memory was 141.0 MB in the beginning and 374.9 MB in the end (delta: 233.8 MB). Free memory was 102.5 MB in the beginning and 161.6 MB in the end (delta: -59.1 MB). Peak memory consumption was 174.7 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:45,961 INFO  L168              Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-16 11:05:45,963 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 715.70 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 159.0 MB in the end (delta: -56.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:45,966 INFO  L168              Benchmark]: Boogie Procedure Inliner took 66.35 ms. Allocated memory is still 205.0 MB. Free memory was 159.0 MB in the beginning and 156.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:45,967 INFO  L168              Benchmark]: Boogie Preprocessor took 46.74 ms. Allocated memory is still 205.0 MB. Free memory was 156.4 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:45,967 INFO  L168              Benchmark]: RCFGBuilder took 2365.49 ms. Allocated memory was 205.0 MB in the beginning and 244.8 MB in the end (delta: 39.8 MB). Free memory was 154.5 MB in the beginning and 161.8 MB in the end (delta: -7.3 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:45,968 INFO  L168              Benchmark]: TraceAbstraction took 7764.34 ms. Allocated memory was 244.8 MB in the beginning and 374.9 MB in the end (delta: 130.0 MB). Free memory was 161.8 MB in the beginning and 161.6 MB in the end (delta: 190.6 kB). Peak memory consumption was 130.2 MB. Max. memory is 7.1 GB.
[2020-10-16 11:05:45,974 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.20 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 715.70 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 159.0 MB in the end (delta: -56.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 66.35 ms. Allocated memory is still 205.0 MB. Free memory was 159.0 MB in the beginning and 156.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 46.74 ms. Allocated memory is still 205.0 MB. Free memory was 156.4 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2365.49 ms. Allocated memory was 205.0 MB in the beginning and 244.8 MB in the end (delta: 39.8 MB). Free memory was 154.5 MB in the beginning and 161.8 MB in the end (delta: -7.3 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 7764.34 ms. Allocated memory was 244.8 MB in the beginning and 374.9 MB in the end (delta: 130.0 MB). Free memory was 161.8 MB in the beginning and 161.6 MB in the end (delta: 190.6 kB). Peak memory consumption was 130.2 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1246 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 174 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.5s, 106 PlacesBefore, 39 PlacesAfterwards, 98 TransitionsBefore, 30 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 5618 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p0_EAX = 0;
[L702]               0  int __unbuffered_p1_EAX = 0;
[L704]               0  int __unbuffered_p1_EBX = 0;
[L706]               0  int __unbuffered_p2_EAX = 0;
[L708]               0  int __unbuffered_p2_EBX = 0;
[L709]               0  _Bool main$tmp_guard0;
[L710]               0  _Bool main$tmp_guard1;
[L712]               0  int x = 0;
[L714]               0  int y = 0;
[L716]               0  int z = 0;
[L717]               0  _Bool z$flush_delayed;
[L718]               0  int z$mem_tmp;
[L719]               0  _Bool z$r_buff0_thd0;
[L720]               0  _Bool z$r_buff0_thd1;
[L721]               0  _Bool z$r_buff0_thd2;
[L722]               0  _Bool z$r_buff0_thd3;
[L723]               0  _Bool z$r_buff1_thd0;
[L724]               0  _Bool z$r_buff1_thd1;
[L725]               0  _Bool z$r_buff1_thd2;
[L726]               0  _Bool z$r_buff1_thd3;
[L727]               0  _Bool z$read_delayed;
[L728]               0  int *z$read_delayed_var;
[L729]               0  int z$w_buff0;
[L730]               0  _Bool z$w_buff0_used;
[L731]               0  int z$w_buff1;
[L732]               0  _Bool z$w_buff1_used;
[L733]               0  _Bool weak$$choice0;
[L734]               0  _Bool weak$$choice2;
[L834]               0  pthread_t t83;
[L835]  FCALL, FORK  0  pthread_create(&t83, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L836]               0  pthread_t t84;
[L738]               1  z$w_buff1 = z$w_buff0
[L739]               1  z$w_buff0 = 1
[L740]               1  z$w_buff1_used = z$w_buff0_used
[L741]               1  z$w_buff0_used = (_Bool)1
[L7]    COND FALSE   1  !(!expression)
[L743]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L744]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L745]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L746]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L747]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L750]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L837]  FCALL, FORK  0  pthread_create(&t84, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L838]               0  pthread_t t85;
[L839]  FCALL, FORK  0  pthread_create(&t85, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L767]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L770]               2  __unbuffered_p1_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L773]               2  __unbuffered_p1_EBX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L790]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L793]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L796]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L797]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L798]               3  z$flush_delayed = weak$$choice2
[L799]               3  z$mem_tmp = z
[L800]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L800]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L801]  EXPR         3  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L801]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L802]  EXPR         3  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L802]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L803]  EXPR         3  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L803]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)
[L803]  EXPR         3  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L803]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L804]  EXPR         3  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L804]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L804]  EXPR         3  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L804]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L805]  EXPR         3  weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L805]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L806]  EXPR         3  weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L806]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L807]               3  __unbuffered_p2_EBX = z
[L808]  EXPR         3  z$flush_delayed ? z$mem_tmp : z
[L808]               3  z = z$flush_delayed ? z$mem_tmp : z
[L809]               3  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L753]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L753]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L754]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L754]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L755]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L755]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L756]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L756]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L757]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L757]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L812]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L812]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L813]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L813]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L814]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L814]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L815]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L815]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L816]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L816]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L760]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L762]               1  return 0;
[L819]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L821]               3  return 0;
[L776]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L776]  EXPR         2  z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z
[L776]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L776]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L777]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L777]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L778]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L778]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L779]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L779]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L780]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L780]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L785]               2  return 0;
[L841]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L845]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L845]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L845]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L845]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L846]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L846]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L847]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L847]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L848]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L848]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L849]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L849]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L852]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 394 SDtfs, 451 SDslu, 1102 SDs, 0 SdLazy, 513 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 107 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 20800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...