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


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


This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b
[2021-06-05 19:55:55,183 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-06-05 19:55:55,185 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-05 19:55:55,202 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-05 19:55:55,202 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-05 19:55:55,203 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-05 19:55:55,204 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-05 19:55:55,205 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-05 19:55:55,206 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-05 19:55:55,206 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-05 19:55:55,207 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-06-05 19:55:55,208 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-05 19:55:55,208 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-05 19:55:55,208 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-05 19:55:55,209 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-05 19:55:55,210 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-05 19:55:55,210 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-05 19:55:55,211 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-05 19:55:55,212 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-05 19:55:55,213 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-05 19:55:55,213 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-05 19:55:55,214 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-05 19:55:55,215 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-06-05 19:55:55,215 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-05 19:55:55,217 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-05 19:55:55,217 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-05 19:55:55,217 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-05 19:55:55,217 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-05 19:55:55,218 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-05 19:55:55,218 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-05 19:55:55,218 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-05 19:55:55,219 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-05 19:55:55,219 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-05 19:55:55,220 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-05 19:55:55,220 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-05 19:55:55,220 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-05 19:55:55,221 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-05 19:55:55,221 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-05 19:55:55,221 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-05 19:55:55,222 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-05 19:55:55,222 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-06-05 19:55:55,223 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf
[2021-06-05 19:55:55,237 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-06-05 19:55:55,237 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-05 19:55:55,237 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-05 19:55:55,238 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-05 19:55:55,238 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-05 19:55:55,238 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-06-05 19:55:55,239 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-06-05 19:55:55,239 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-05 19:55:55,239 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-06-05 19:55:55,239 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-06-05 19:55:55,239 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-06-05 19:55:55,239 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-06-05 19:55:55,239 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-06-05 19:55:55,239 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-05 19:55:55,240 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-06-05 19:55:55,240 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-06-05 19:55:55,240 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-06-05 19:55:55,240 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-06-05 19:55:55,240 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-06-05 19:55:55,240 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-05 19:55:55,240 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-06-05 19:55:55,240 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-06-05 19:55:55,240 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-06-05 19:55:55,241 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-05 19:55:55,241 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-05 19:55:55,241 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-06-05 19:55:55,241 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-05 19:55:55,241 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-06-05 19:55:55,241 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-05 19:55:55,241 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-06-05 19:55:55,241 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-05 19:55:55,241 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-05 19:55:55,461 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-05 19:55:55,479 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-05 19:55:55,481 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-05 19:55:55,481 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-06-05 19:55:55,482 INFO  L275        PluginConnector]: CDTParser initialized
[2021-06-05 19:55:55,482 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i
[2021-06-05 19:55:55,527 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e225da34/dc9e055ddc5f4762beaf9dbee7a148b9/FLAGc8998bbf4
[2021-06-05 19:55:56,203 INFO  L306              CDTParser]: Found 1 translation units.
[2021-06-05 19:55:56,203 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i
[2021-06-05 19:55:56,213 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e225da34/dc9e055ddc5f4762beaf9dbee7a148b9/FLAGc8998bbf4
[2021-06-05 19:55:56,553 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e225da34/dc9e055ddc5f4762beaf9dbee7a148b9
[2021-06-05 19:55:56,554 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-05 19:55:56,555 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-05 19:55:56,557 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-05 19:55:56,557 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-05 19:55:56,559 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-05 19:55:56,559 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,560 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fbd8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56, skipping insertion in model container
[2021-06-05 19:55:56,560 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,565 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-06-05 19:55:56,605 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-06-05 19:55:56,693 WARN  L224   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i[992,1005]
[2021-06-05 19:55:56,856 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-05 19:55:56,869 INFO  L203         MainTranslator]: Completed pre-run
[2021-06-05 19:55:56,878 WARN  L224   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i[992,1005]
[2021-06-05 19:55:56,909 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-05 19:55:56,943 INFO  L208         MainTranslator]: Completed translation
[2021-06-05 19:55:56,944 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56 WrapperNode
[2021-06-05 19:55:56,944 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-05 19:55:56,944 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-05 19:55:56,945 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-05 19:55:56,945 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-05 19:55:56,949 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,961 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:56,987 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-05 19:55:56,988 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-05 19:55:56,988 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-05 19:55:56,994 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-06-05 19:55:56,999 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:57,000 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:57,017 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:57,017 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:57,025 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:57,028 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:57,040 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
[2021-06-05 19:55:57,044 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-05 19:55:57,045 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-05 19:55:57,045 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-06-05 19:55:57,045 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-06-05 19:55:57,045 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-05 19:55:57,104 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-06-05 19:55:57,104 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-05 19:55:57,104 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-05 19:55:57,105 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-05 19:55:57,105 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-06-05 19:55:57,106 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-06-05 19:55:57,107 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-06-05 19:55:57,107 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-06-05 19:55:57,107 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-06-05 19:55:57,107 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-06-05 19:55:57,107 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-05 19:55:57,107 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-05 19:55:57,107 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-05 19:55:57,107 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-05 19:55:57,108 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-05 19:55:59,176 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-05 19:55:59,177 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-05 19:55:59,178 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:55:59 BoogieIcfgContainer
[2021-06-05 19:55:59,179 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-05 19:55:59,180 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-05 19:55:59,180 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-06-05 19:55:59,181 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-06-05 19:55:59,181 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:55:56" (1/3) ...
[2021-06-05 19:55:59,182 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73637eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:55:59, skipping insertion in model container
[2021-06-05 19:55:59,182 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:56" (2/3) ...
[2021-06-05 19:55:59,183 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73637eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:55:59, skipping insertion in model container
[2021-06-05 19:55:59,183 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:55:59" (3/3) ...
[2021-06-05 19:55:59,184 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe023_pso.opt.i
[2021-06-05 19:55:59,188 WARN  L148   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-05 19:55:59,188 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-05 19:55:59,189 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-05 19:55:59,189 INFO  L471   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-05 19:55:59,221 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,221 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,221 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,222 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,223 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,223 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,223 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,223 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,223 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,223 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,224 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,224 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,224 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,224 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,224 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,224 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,224 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,224 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,225 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,225 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,225 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,225 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,225 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,225 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,225 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,225 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,225 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,226 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,227 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,227 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,227 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,227 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,227 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,227 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,228 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,228 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,228 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,228 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,228 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,228 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,228 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,229 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,230 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,231 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,231 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,232 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,233 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,234 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,235 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,235 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,239 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,240 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,241 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,242 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,243 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,244 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,244 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,245 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,246 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,247 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,248 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,249 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,250 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,254 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,255 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,257 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,258 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,259 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,260 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,261 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,263 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,264 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,265 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,267 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,268 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,269 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,270 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,270 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,270 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,273 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:59,274 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-05 19:55:59,289 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-05 19:55:59,308 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-05 19:55:59,308 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-05 19:55:59,308 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-05 19:55:59,308 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-05 19:55:59,308 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-05 19:55:59,308 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-05 19:55:59,308 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-05 19:55:59,308 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1========
[2021-06-05 19:55:59,317 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow
[2021-06-05 19:56:00,087 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:00,129 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:00,267 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-05 19:56:00,267 INFO  L301   ceAbstractionStarter]: Result for error location P1 was SAFE (1/3)
[2021-06-05 19:56:00,269 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-05 19:56:00,270 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-05 19:56:00,270 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-05 19:56:00,270 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-05 19:56:00,270 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-05 19:56:00,270 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-05 19:56:00,270 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-05 19:56:00,270 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-05 19:56:00,270 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork2========
[2021-06-05 19:56:00,273 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow
[2021-06-05 19:56:00,866 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:00,891 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:00,892 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2021-06-05 19:56:00,892 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:00,893 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:00,893 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:00,896 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:00,896 INFO  L82        PathProgramCache]: Analyzing trace with hash -865950546, now seen corresponding path program 1 times
[2021-06-05 19:56:00,901 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:00,902 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948000105]
[2021-06-05 19:56:00,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:00,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:01,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:01,097 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:01,097 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948000105]
[2021-06-05 19:56:01,098 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948000105] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:01,098 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:01,098 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-05 19:56:01,098 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788212535]
[2021-06-05 19:56:01,101 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-05 19:56:01,101 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:01,108 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-05 19:56:01,108 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-05 19:56:01,132 INFO  L87              Difference]: Start difference. First operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:01,444 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:01,444 INFO  L93              Difference]: Finished difference Result 15583 states and 55472 transitions.
[2021-06-05 19:56:01,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-05 19:56:01,446 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49
[2021-06-05 19:56:01,447 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:01,450 INFO  L225             Difference]: With dead ends: 15583
[2021-06-05 19:56:01,450 INFO  L226             Difference]: Without dead ends: 0
[2021-06-05 19:56:01,451 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-05 19:56:01,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-05 19:56:01,463 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-05 19:56:01,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:01,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-05 19:56:01,465 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49
[2021-06-05 19:56:01,465 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:01,465 INFO  L482      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-05 19:56:01,465 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:01,465 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-05 19:56:01,465 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-05 19:56:01,465 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-05 19:56:01,465 INFO  L301   ceAbstractionStarter]: Result for error location P1Thread1of1ForFork2 was SAFE (2/3)
[2021-06-05 19:56:01,466 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2021-06-05 19:56:01,467 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-05 19:56:01,467 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-05 19:56:01,467 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-05 19:56:01,467 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-05 19:56:01,467 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-05 19:56:01,467 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-05 19:56:01,467 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-05 19:56:01,467 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-05 19:56:01,468 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow
[2021-06-05 19:56:02,041 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:02,059 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:02,068 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2021-06-05 19:56:02,068 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:02,068 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:02,068 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:02,069 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:02,069 INFO  L82        PathProgramCache]: Analyzing trace with hash -64619290, now seen corresponding path program 1 times
[2021-06-05 19:56:02,069 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:02,069 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821366856]
[2021-06-05 19:56:02,069 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:02,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:02,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:02,251 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:02,251 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821366856]
[2021-06-05 19:56:02,252 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821366856] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:02,252 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:02,253 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-05 19:56:02,253 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092354464]
[2021-06-05 19:56:02,254 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-05 19:56:02,254 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:02,255 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-05 19:56:02,255 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-05 19:56:02,276 INFO  L87              Difference]: Start difference. First operand  has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:02,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:02,606 INFO  L93              Difference]: Finished difference Result 21982 states and 78062 transitions.
[2021-06-05 19:56:02,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:02,607 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68
[2021-06-05 19:56:02,607 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:02,662 INFO  L225             Difference]: With dead ends: 21982
[2021-06-05 19:56:02,662 INFO  L226             Difference]: Without dead ends: 8662
[2021-06-05 19:56:02,663 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 79.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:02,690 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8662 states.
[2021-06-05 19:56:02,858 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8662 to 8662.
[2021-06-05 19:56:02,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8662 states, 8660 states have (on average 3.4742494226327945) internal successors, (30087), 8661 states have internal predecessors, (30087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:02,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 30087 transitions.
[2021-06-05 19:56:02,911 INFO  L78                 Accepts]: Start accepts. Automaton has 8662 states and 30087 transitions. Word has length 68
[2021-06-05 19:56:02,912 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:02,912 INFO  L482      AbstractCegarLoop]: Abstraction has 8662 states and 30087 transitions.
[2021-06-05 19:56:02,912 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:02,912 INFO  L276                IsEmpty]: Start isEmpty. Operand 8662 states and 30087 transitions.
[2021-06-05 19:56:02,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2021-06-05 19:56:02,923 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:02,924 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:02,924 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-05 19:56:02,924 INFO  L430      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:02,924 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:02,924 INFO  L82        PathProgramCache]: Analyzing trace with hash 103649628, now seen corresponding path program 1 times
[2021-06-05 19:56:02,924 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:02,925 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481826527]
[2021-06-05 19:56:02,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:03,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:03,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:03,302 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:03,302 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481826527]
[2021-06-05 19:56:03,302 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481826527] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:03,302 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:03,302 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-05 19:56:03,302 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332547173]
[2021-06-05 19:56:03,303 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-05 19:56:03,303 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:03,303 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-05 19:56:03,304 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:03,305 INFO  L87              Difference]: Start difference. First operand 8662 states and 30087 transitions. Second operand  has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:03,710 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:03,710 INFO  L93              Difference]: Finished difference Result 9297 states and 32011 transitions.
[2021-06-05 19:56:03,711 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2021-06-05 19:56:03,711 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2021-06-05 19:56:03,711 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:03,743 INFO  L225             Difference]: With dead ends: 9297
[2021-06-05 19:56:03,743 INFO  L226             Difference]: Without dead ends: 7897
[2021-06-05 19:56:03,744 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 268.6ms TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462
[2021-06-05 19:56:03,766 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7897 states.
[2021-06-05 19:56:03,943 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7897 to 7897.
[2021-06-05 19:56:03,953 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7897 states, 7895 states have (on average 3.4580113996200126) internal successors, (27301), 7896 states have internal predecessors, (27301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:03,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 27301 transitions.
[2021-06-05 19:56:03,978 INFO  L78                 Accepts]: Start accepts. Automaton has 7897 states and 27301 transitions. Word has length 72
[2021-06-05 19:56:03,979 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:03,979 INFO  L482      AbstractCegarLoop]: Abstraction has 7897 states and 27301 transitions.
[2021-06-05 19:56:03,979 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:03,980 INFO  L276                IsEmpty]: Start isEmpty. Operand 7897 states and 27301 transitions.
[2021-06-05 19:56:03,991 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2021-06-05 19:56:03,991 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:03,991 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:03,991 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-05 19:56:03,991 INFO  L430      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:03,992 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:03,992 INFO  L82        PathProgramCache]: Analyzing trace with hash 1166124987, now seen corresponding path program 1 times
[2021-06-05 19:56:03,992 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:03,993 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112140497]
[2021-06-05 19:56:03,993 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:04,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:04,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:04,130 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:04,130 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112140497]
[2021-06-05 19:56:04,130 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112140497] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:04,130 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:04,130 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-05 19:56:04,130 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997988418]
[2021-06-05 19:56:04,131 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-05 19:56:04,131 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:04,131 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-05 19:56:04,131 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-05 19:56:04,131 INFO  L87              Difference]: Start difference. First operand 7897 states and 27301 transitions. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:04,283 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:04,283 INFO  L93              Difference]: Finished difference Result 10687 states and 36778 transitions.
[2021-06-05 19:56:04,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-05 19:56:04,284 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2021-06-05 19:56:04,286 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:04,300 INFO  L225             Difference]: With dead ends: 10687
[2021-06-05 19:56:04,300 INFO  L226             Difference]: Without dead ends: 5233
[2021-06-05 19:56:04,300 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 108.9ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2021-06-05 19:56:04,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5233 states.
[2021-06-05 19:56:04,383 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 5233.
[2021-06-05 19:56:04,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5233 states, 5232 states have (on average 3.3298929663608563) internal successors, (17422), 5232 states have internal predecessors, (17422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:04,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 17422 transitions.
[2021-06-05 19:56:04,399 INFO  L78                 Accepts]: Start accepts. Automaton has 5233 states and 17422 transitions. Word has length 74
[2021-06-05 19:56:04,400 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:04,400 INFO  L482      AbstractCegarLoop]: Abstraction has 5233 states and 17422 transitions.
[2021-06-05 19:56:04,400 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:04,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 5233 states and 17422 transitions.
[2021-06-05 19:56:04,408 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2021-06-05 19:56:04,408 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:04,408 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:04,408 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-05 19:56:04,408 INFO  L430      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:04,409 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:04,409 INFO  L82        PathProgramCache]: Analyzing trace with hash -2052241606, now seen corresponding path program 1 times
[2021-06-05 19:56:04,409 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:04,409 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784516079]
[2021-06-05 19:56:04,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:04,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:04,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:04,738 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:04,738 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784516079]
[2021-06-05 19:56:04,739 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784516079] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:04,739 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:04,739 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-05 19:56:04,739 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010277304]
[2021-06-05 19:56:04,739 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-05 19:56:04,739 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:04,740 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-05 19:56:04,740 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2021-06-05 19:56:04,740 INFO  L87              Difference]: Start difference. First operand 5233 states and 17422 transitions. Second operand  has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:05,302 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:05,302 INFO  L93              Difference]: Finished difference Result 6688 states and 22287 transitions.
[2021-06-05 19:56:05,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-06-05 19:56:05,303 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2021-06-05 19:56:05,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:05,318 INFO  L225             Difference]: With dead ends: 6688
[2021-06-05 19:56:05,318 INFO  L226             Difference]: Without dead ends: 5972
[2021-06-05 19:56:05,318 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 374.0ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306
[2021-06-05 19:56:05,333 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5972 states.
[2021-06-05 19:56:05,428 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 5653.
[2021-06-05 19:56:05,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5653 states, 5652 states have (on average 3.341295116772824) internal successors, (18885), 5652 states have internal predecessors, (18885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:05,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 18885 transitions.
[2021-06-05 19:56:05,529 INFO  L78                 Accepts]: Start accepts. Automaton has 5653 states and 18885 transitions. Word has length 77
[2021-06-05 19:56:05,530 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:05,530 INFO  L482      AbstractCegarLoop]: Abstraction has 5653 states and 18885 transitions.
[2021-06-05 19:56:05,530 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:05,530 INFO  L276                IsEmpty]: Start isEmpty. Operand 5653 states and 18885 transitions.
[2021-06-05 19:56:05,538 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2021-06-05 19:56:05,538 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:05,538 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:05,538 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-05 19:56:05,538 INFO  L430      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:05,538 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:05,539 INFO  L82        PathProgramCache]: Analyzing trace with hash 2048735284, now seen corresponding path program 2 times
[2021-06-05 19:56:05,539 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:05,539 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104187682]
[2021-06-05 19:56:05,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:05,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:05,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:05,822 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:05,822 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104187682]
[2021-06-05 19:56:05,822 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104187682] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:05,822 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:05,822 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-05 19:56:05,822 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562329011]
[2021-06-05 19:56:05,823 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-05 19:56:05,823 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:05,823 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-05 19:56:05,823 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:05,823 INFO  L87              Difference]: Start difference. First operand 5653 states and 18885 transitions. Second operand  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:06,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:06,188 INFO  L93              Difference]: Finished difference Result 6617 states and 22021 transitions.
[2021-06-05 19:56:06,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-05 19:56:06,188 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2021-06-05 19:56:06,189 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:06,205 INFO  L225             Difference]: With dead ends: 6617
[2021-06-05 19:56:06,206 INFO  L226             Difference]: Without dead ends: 6001
[2021-06-05 19:56:06,206 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 250.3ms TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462
[2021-06-05 19:56:06,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6001 states.
[2021-06-05 19:56:06,294 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 5824.
[2021-06-05 19:56:06,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5824 states, 5823 states have (on average 3.336081057873948) internal successors, (19426), 5823 states have internal predecessors, (19426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:06,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5824 states to 5824 states and 19426 transitions.
[2021-06-05 19:56:06,314 INFO  L78                 Accepts]: Start accepts. Automaton has 5824 states and 19426 transitions. Word has length 77
[2021-06-05 19:56:06,315 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:06,315 INFO  L482      AbstractCegarLoop]: Abstraction has 5824 states and 19426 transitions.
[2021-06-05 19:56:06,315 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:06,315 INFO  L276                IsEmpty]: Start isEmpty. Operand 5824 states and 19426 transitions.
[2021-06-05 19:56:06,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-06-05 19:56:06,324 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:06,324 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:06,324 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-05 19:56:06,324 INFO  L430      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:06,325 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:06,325 INFO  L82        PathProgramCache]: Analyzing trace with hash 1496306420, now seen corresponding path program 1 times
[2021-06-05 19:56:06,325 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:06,325 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125709142]
[2021-06-05 19:56:06,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:06,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:06,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:06,730 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:06,730 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125709142]
[2021-06-05 19:56:06,730 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125709142] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:06,730 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:06,730 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-05 19:56:06,730 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657808496]
[2021-06-05 19:56:06,731 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-05 19:56:06,731 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:06,731 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-05 19:56:06,731 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:06,731 INFO  L87              Difference]: Start difference. First operand 5824 states and 19426 transitions. Second operand  has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,141 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:07,142 INFO  L93              Difference]: Finished difference Result 6765 states and 22448 transitions.
[2021-06-05 19:56:07,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-05 19:56:07,142 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78
[2021-06-05 19:56:07,142 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:07,156 INFO  L225             Difference]: With dead ends: 6765
[2021-06-05 19:56:07,156 INFO  L226             Difference]: Without dead ends: 6285
[2021-06-05 19:56:07,157 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 346.9ms TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462
[2021-06-05 19:56:07,169 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6285 states.
[2021-06-05 19:56:07,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 6013.
[2021-06-05 19:56:07,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6013 states, 6012 states have (on average 3.3399866932801063) internal successors, (20080), 6012 states have internal predecessors, (20080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6013 states to 6013 states and 20080 transitions.
[2021-06-05 19:56:07,255 INFO  L78                 Accepts]: Start accepts. Automaton has 6013 states and 20080 transitions. Word has length 78
[2021-06-05 19:56:07,255 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:07,255 INFO  L482      AbstractCegarLoop]: Abstraction has 6013 states and 20080 transitions.
[2021-06-05 19:56:07,255 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,256 INFO  L276                IsEmpty]: Start isEmpty. Operand 6013 states and 20080 transitions.
[2021-06-05 19:56:07,264 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-06-05 19:56:07,265 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:07,265 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:07,265 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-05 19:56:07,265 INFO  L430      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:07,265 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:07,265 INFO  L82        PathProgramCache]: Analyzing trace with hash 6401276, now seen corresponding path program 1 times
[2021-06-05 19:56:07,265 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:07,265 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289019245]
[2021-06-05 19:56:07,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:07,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:07,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:07,356 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:07,356 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289019245]
[2021-06-05 19:56:07,356 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289019245] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:07,356 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:07,356 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-05 19:56:07,356 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778571277]
[2021-06-05 19:56:07,357 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-05 19:56:07,357 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:07,357 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-05 19:56:07,357 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-05 19:56:07,357 INFO  L87              Difference]: Start difference. First operand 6013 states and 20080 transitions. Second operand  has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,464 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:07,464 INFO  L93              Difference]: Finished difference Result 7141 states and 23519 transitions.
[2021-06-05 19:56:07,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:07,465 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78
[2021-06-05 19:56:07,465 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:07,480 INFO  L225             Difference]: With dead ends: 7141
[2021-06-05 19:56:07,481 INFO  L226             Difference]: Without dead ends: 5197
[2021-06-05 19:56:07,481 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 70.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:07,494 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5197 states.
[2021-06-05 19:56:07,565 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5194.
[2021-06-05 19:56:07,571 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5194 states, 5193 states have (on average 3.2649720777970344) internal successors, (16955), 5193 states have internal predecessors, (16955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 16955 transitions.
[2021-06-05 19:56:07,584 INFO  L78                 Accepts]: Start accepts. Automaton has 5194 states and 16955 transitions. Word has length 78
[2021-06-05 19:56:07,584 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:07,584 INFO  L482      AbstractCegarLoop]: Abstraction has 5194 states and 16955 transitions.
[2021-06-05 19:56:07,584 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,585 INFO  L276                IsEmpty]: Start isEmpty. Operand 5194 states and 16955 transitions.
[2021-06-05 19:56:07,592 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-06-05 19:56:07,593 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:07,593 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:07,593 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-05 19:56:07,593 INFO  L430      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:07,593 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:07,593 INFO  L82        PathProgramCache]: Analyzing trace with hash -2132362663, now seen corresponding path program 1 times
[2021-06-05 19:56:07,593 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:07,594 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555536408]
[2021-06-05 19:56:07,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:07,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:07,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:07,685 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:07,687 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555536408]
[2021-06-05 19:56:07,687 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555536408] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:07,687 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:07,687 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-05 19:56:07,687 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790531011]
[2021-06-05 19:56:07,687 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-05 19:56:07,687 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:07,688 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-05 19:56:07,688 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-05 19:56:07,688 INFO  L87              Difference]: Start difference. First operand 5194 states and 16955 transitions. Second operand  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,797 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:07,798 INFO  L93              Difference]: Finished difference Result 5098 states and 16234 transitions.
[2021-06-05 19:56:07,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-05 19:56:07,798 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2021-06-05 19:56:07,798 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:07,805 INFO  L225             Difference]: With dead ends: 5098
[2021-06-05 19:56:07,805 INFO  L226             Difference]: Without dead ends: 3646
[2021-06-05 19:56:07,805 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 79.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:07,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3646 states.
[2021-06-05 19:56:07,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3355.
[2021-06-05 19:56:07,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3355 states, 3354 states have (on average 3.112701252236136) internal successors, (10440), 3354 states have internal predecessors, (10440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 10440 transitions.
[2021-06-05 19:56:07,861 INFO  L78                 Accepts]: Start accepts. Automaton has 3355 states and 10440 transitions. Word has length 79
[2021-06-05 19:56:07,861 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:07,861 INFO  L482      AbstractCegarLoop]: Abstraction has 3355 states and 10440 transitions.
[2021-06-05 19:56:07,861 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:07,862 INFO  L276                IsEmpty]: Start isEmpty. Operand 3355 states and 10440 transitions.
[2021-06-05 19:56:07,866 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-06-05 19:56:07,866 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:07,866 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:07,866 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-05 19:56:07,866 INFO  L430      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:07,866 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:07,867 INFO  L82        PathProgramCache]: Analyzing trace with hash -1983514022, now seen corresponding path program 1 times
[2021-06-05 19:56:07,867 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:07,867 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583123094]
[2021-06-05 19:56:07,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:07,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:08,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:08,062 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:08,062 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583123094]
[2021-06-05 19:56:08,062 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583123094] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:08,062 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:08,062 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-05 19:56:08,062 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515379265]
[2021-06-05 19:56:08,063 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-05 19:56:08,063 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:08,064 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-05 19:56:08,064 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2021-06-05 19:56:08,064 INFO  L87              Difference]: Start difference. First operand 3355 states and 10440 transitions. Second operand  has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:08,395 INFO  L93              Difference]: Finished difference Result 5476 states and 17064 transitions.
[2021-06-05 19:56:08,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-05 19:56:08,396 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2021-06-05 19:56:08,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:08,403 INFO  L225             Difference]: With dead ends: 5476
[2021-06-05 19:56:08,403 INFO  L226             Difference]: Without dead ends: 3938
[2021-06-05 19:56:08,405 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 218.0ms TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240
[2021-06-05 19:56:08,412 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3938 states.
[2021-06-05 19:56:08,453 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3483.
[2021-06-05 19:56:08,456 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3483 states, 3482 states have (on average 3.0947731188971854) internal successors, (10776), 3482 states have internal predecessors, (10776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 10776 transitions.
[2021-06-05 19:56:08,463 INFO  L78                 Accepts]: Start accepts. Automaton has 3483 states and 10776 transitions. Word has length 81
[2021-06-05 19:56:08,463 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:08,463 INFO  L482      AbstractCegarLoop]: Abstraction has 3483 states and 10776 transitions.
[2021-06-05 19:56:08,463 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,463 INFO  L276                IsEmpty]: Start isEmpty. Operand 3483 states and 10776 transitions.
[2021-06-05 19:56:08,472 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-06-05 19:56:08,472 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:08,472 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:08,472 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-05 19:56:08,473 INFO  L430      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:08,473 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:08,473 INFO  L82        PathProgramCache]: Analyzing trace with hash -1707571174, now seen corresponding path program 2 times
[2021-06-05 19:56:08,473 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:08,474 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448386200]
[2021-06-05 19:56:08,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:08,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:08,573 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:08,573 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:08,573 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448386200]
[2021-06-05 19:56:08,573 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448386200] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:08,573 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:08,573 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-05 19:56:08,573 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252878018]
[2021-06-05 19:56:08,574 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-05 19:56:08,574 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:08,574 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-05 19:56:08,574 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-05 19:56:08,574 INFO  L87              Difference]: Start difference. First operand 3483 states and 10776 transitions. Second operand  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,684 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:08,684 INFO  L93              Difference]: Finished difference Result 2961 states and 8973 transitions.
[2021-06-05 19:56:08,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-05 19:56:08,687 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2021-06-05 19:56:08,688 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:08,692 INFO  L225             Difference]: With dead ends: 2961
[2021-06-05 19:56:08,692 INFO  L226             Difference]: Without dead ends: 2349
[2021-06-05 19:56:08,692 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 89.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:08,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2349 states.
[2021-06-05 19:56:08,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2301.
[2021-06-05 19:56:08,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2301 states, 2300 states have (on average 2.9756521739130433) internal successors, (6844), 2300 states have internal predecessors, (6844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 6844 transitions.
[2021-06-05 19:56:08,730 INFO  L78                 Accepts]: Start accepts. Automaton has 2301 states and 6844 transitions. Word has length 81
[2021-06-05 19:56:08,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:08,730 INFO  L482      AbstractCegarLoop]: Abstraction has 2301 states and 6844 transitions.
[2021-06-05 19:56:08,730 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:08,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 2301 states and 6844 transitions.
[2021-06-05 19:56:08,733 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:08,733 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:08,733 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:08,733 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-05 19:56:08,733 INFO  L430      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:08,733 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:08,733 INFO  L82        PathProgramCache]: Analyzing trace with hash -1806497211, now seen corresponding path program 1 times
[2021-06-05 19:56:08,733 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:08,734 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984119660]
[2021-06-05 19:56:08,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:08,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:08,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:08,881 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:08,882 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984119660]
[2021-06-05 19:56:08,882 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984119660] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:08,882 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:08,882 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-05 19:56:08,882 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945761781]
[2021-06-05 19:56:08,882 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-05 19:56:08,882 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:08,883 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-05 19:56:08,883 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2021-06-05 19:56:08,883 INFO  L87              Difference]: Start difference. First operand 2301 states and 6844 transitions. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,093 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:09,093 INFO  L93              Difference]: Finished difference Result 4869 states and 14681 transitions.
[2021-06-05 19:56:09,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-05 19:56:09,093 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-05 19:56:09,094 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:09,099 INFO  L225             Difference]: With dead ends: 4869
[2021-06-05 19:56:09,099 INFO  L226             Difference]: Without dead ends: 3184
[2021-06-05 19:56:09,100 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 98.8ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2021-06-05 19:56:09,105 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3184 states.
[2021-06-05 19:56:09,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2539.
[2021-06-05 19:56:09,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2539 states, 2538 states have (on average 2.9357762017336486) internal successors, (7451), 2538 states have internal predecessors, (7451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 7451 transitions.
[2021-06-05 19:56:09,143 INFO  L78                 Accepts]: Start accepts. Automaton has 2539 states and 7451 transitions. Word has length 84
[2021-06-05 19:56:09,143 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:09,143 INFO  L482      AbstractCegarLoop]: Abstraction has 2539 states and 7451 transitions.
[2021-06-05 19:56:09,143 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,143 INFO  L276                IsEmpty]: Start isEmpty. Operand 2539 states and 7451 transitions.
[2021-06-05 19:56:09,146 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:09,146 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:09,146 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:09,146 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-05 19:56:09,146 INFO  L430      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:09,147 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:09,147 INFO  L82        PathProgramCache]: Analyzing trace with hash -1526451131, now seen corresponding path program 2 times
[2021-06-05 19:56:09,147 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:09,147 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175269137]
[2021-06-05 19:56:09,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:09,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:09,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:09,343 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:09,343 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175269137]
[2021-06-05 19:56:09,344 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175269137] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:09,344 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:09,344 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-05 19:56:09,344 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755362022]
[2021-06-05 19:56:09,344 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-05 19:56:09,344 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:09,345 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-05 19:56:09,345 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:09,345 INFO  L87              Difference]: Start difference. First operand 2539 states and 7451 transitions. Second operand  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,588 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:09,588 INFO  L93              Difference]: Finished difference Result 3528 states and 10537 transitions.
[2021-06-05 19:56:09,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-06-05 19:56:09,589 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-05 19:56:09,589 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:09,593 INFO  L225             Difference]: With dead ends: 3528
[2021-06-05 19:56:09,593 INFO  L226             Difference]: Without dead ends: 2395
[2021-06-05 19:56:09,594 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 130.2ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306
[2021-06-05 19:56:09,598 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2395 states.
[2021-06-05 19:56:09,622 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2320.
[2021-06-05 19:56:09,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2320 states, 2319 states have (on average 2.9655023717119446) internal successors, (6877), 2319 states have internal predecessors, (6877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 6877 transitions.
[2021-06-05 19:56:09,628 INFO  L78                 Accepts]: Start accepts. Automaton has 2320 states and 6877 transitions. Word has length 84
[2021-06-05 19:56:09,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:09,628 INFO  L482      AbstractCegarLoop]: Abstraction has 2320 states and 6877 transitions.
[2021-06-05 19:56:09,628 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:09,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 2320 states and 6877 transitions.
[2021-06-05 19:56:09,631 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:09,631 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:09,631 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:09,631 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-05 19:56:09,631 INFO  L430      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:09,632 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:09,632 INFO  L82        PathProgramCache]: Analyzing trace with hash -723221023, now seen corresponding path program 3 times
[2021-06-05 19:56:09,632 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:09,632 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82470534]
[2021-06-05 19:56:09,632 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:09,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:09,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:09,931 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:09,931 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82470534]
[2021-06-05 19:56:09,931 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82470534] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:09,931 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:09,931 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-05 19:56:09,931 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259700458]
[2021-06-05 19:56:09,931 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-05 19:56:09,931 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:09,932 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-05 19:56:09,932 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:09,932 INFO  L87              Difference]: Start difference. First operand 2320 states and 6877 transitions. Second operand  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,227 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:10,227 INFO  L93              Difference]: Finished difference Result 4264 states and 12724 transitions.
[2021-06-05 19:56:10,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2021-06-05 19:56:10,228 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-05 19:56:10,228 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:10,232 INFO  L225             Difference]: With dead ends: 4264
[2021-06-05 19:56:10,232 INFO  L226             Difference]: Without dead ends: 2939
[2021-06-05 19:56:10,232 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 230.1ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342
[2021-06-05 19:56:10,237 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2939 states.
[2021-06-05 19:56:10,278 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2320.
[2021-06-05 19:56:10,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2320 states, 2319 states have (on average 2.9310047434238897) internal successors, (6797), 2319 states have internal predecessors, (6797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 6797 transitions.
[2021-06-05 19:56:10,284 INFO  L78                 Accepts]: Start accepts. Automaton has 2320 states and 6797 transitions. Word has length 84
[2021-06-05 19:56:10,284 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:10,284 INFO  L482      AbstractCegarLoop]: Abstraction has 2320 states and 6797 transitions.
[2021-06-05 19:56:10,284 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,284 INFO  L276                IsEmpty]: Start isEmpty. Operand 2320 states and 6797 transitions.
[2021-06-05 19:56:10,287 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:10,287 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:10,287 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:10,287 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-05 19:56:10,287 INFO  L430      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:10,287 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:10,287 INFO  L82        PathProgramCache]: Analyzing trace with hash 369412291, now seen corresponding path program 4 times
[2021-06-05 19:56:10,287 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:10,288 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602280786]
[2021-06-05 19:56:10,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:10,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:10,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:10,596 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:10,596 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602280786]
[2021-06-05 19:56:10,596 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602280786] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:10,596 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:10,596 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-05 19:56:10,596 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543104402]
[2021-06-05 19:56:10,597 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-05 19:56:10,597 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:10,597 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-05 19:56:10,597 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:10,597 INFO  L87              Difference]: Start difference. First operand 2320 states and 6797 transitions. Second operand  has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,925 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:10,925 INFO  L93              Difference]: Finished difference Result 3214 states and 9457 transitions.
[2021-06-05 19:56:10,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-05 19:56:10,925 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-05 19:56:10,926 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:10,928 INFO  L225             Difference]: With dead ends: 3214
[2021-06-05 19:56:10,928 INFO  L226             Difference]: Without dead ends: 2378
[2021-06-05 19:56:10,930 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 310.8ms TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420
[2021-06-05 19:56:10,934 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2378 states.
[2021-06-05 19:56:10,963 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2320.
[2021-06-05 19:56:10,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2320 states, 2319 states have (on average 2.9184993531694694) internal successors, (6768), 2319 states have internal predecessors, (6768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 6768 transitions.
[2021-06-05 19:56:10,968 INFO  L78                 Accepts]: Start accepts. Automaton has 2320 states and 6768 transitions. Word has length 84
[2021-06-05 19:56:10,968 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:10,969 INFO  L482      AbstractCegarLoop]: Abstraction has 2320 states and 6768 transitions.
[2021-06-05 19:56:10,969 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:10,969 INFO  L276                IsEmpty]: Start isEmpty. Operand 2320 states and 6768 transitions.
[2021-06-05 19:56:10,971 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:10,971 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:10,971 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:10,971 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-06-05 19:56:10,971 INFO  L430      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:10,972 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:10,972 INFO  L82        PathProgramCache]: Analyzing trace with hash 1224777667, now seen corresponding path program 5 times
[2021-06-05 19:56:10,972 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:10,972 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208230525]
[2021-06-05 19:56:10,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:11,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:11,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:11,330 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:11,330 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208230525]
[2021-06-05 19:56:11,330 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208230525] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:11,330 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:11,330 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2021-06-05 19:56:11,330 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253406241]
[2021-06-05 19:56:11,330 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 17 states
[2021-06-05 19:56:11,331 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:11,331 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2021-06-05 19:56:11,331 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272
[2021-06-05 19:56:11,331 INFO  L87              Difference]: Start difference. First operand 2320 states and 6768 transitions. Second operand  has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:11,625 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:11,626 INFO  L93              Difference]: Finished difference Result 3398 states and 9924 transitions.
[2021-06-05 19:56:11,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-05 19:56:11,626 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-05 19:56:11,626 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:11,629 INFO  L225             Difference]: With dead ends: 3398
[2021-06-05 19:56:11,629 INFO  L226             Difference]: Without dead ends: 2134
[2021-06-05 19:56:11,629 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 310.3ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506
[2021-06-05 19:56:11,632 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2134 states.
[2021-06-05 19:56:11,649 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2134.
[2021-06-05 19:56:11,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2134 states, 2133 states have (on average 2.9338959212376934) internal successors, (6258), 2133 states have internal predecessors, (6258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:11,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 6258 transitions.
[2021-06-05 19:56:11,654 INFO  L78                 Accepts]: Start accepts. Automaton has 2134 states and 6258 transitions. Word has length 84
[2021-06-05 19:56:11,654 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:11,654 INFO  L482      AbstractCegarLoop]: Abstraction has 2134 states and 6258 transitions.
[2021-06-05 19:56:11,654 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:11,654 INFO  L276                IsEmpty]: Start isEmpty. Operand 2134 states and 6258 transitions.
[2021-06-05 19:56:11,656 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:11,656 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:11,657 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:11,657 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-06-05 19:56:11,657 INFO  L430      AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:11,657 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:11,657 INFO  L82        PathProgramCache]: Analyzing trace with hash -628878427, now seen corresponding path program 6 times
[2021-06-05 19:56:11,657 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:11,657 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065881432]
[2021-06-05 19:56:11,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:11,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:11,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:11,867 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:11,867 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065881432]
[2021-06-05 19:56:11,867 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065881432] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:11,867 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:11,867 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-05 19:56:11,867 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989070039]
[2021-06-05 19:56:11,867 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-05 19:56:11,867 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:11,868 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-05 19:56:11,868 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:11,868 INFO  L87              Difference]: Start difference. First operand 2134 states and 6258 transitions. Second operand  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,253 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:12,253 INFO  L93              Difference]: Finished difference Result 4295 states and 12890 transitions.
[2021-06-05 19:56:12,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-05 19:56:12,254 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-05 19:56:12,254 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:12,257 INFO  L225             Difference]: With dead ends: 4295
[2021-06-05 19:56:12,257 INFO  L226             Difference]: Without dead ends: 2253
[2021-06-05 19:56:12,257 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 287.2ms TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506
[2021-06-05 19:56:12,260 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2253 states.
[2021-06-05 19:56:12,278 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1698.
[2021-06-05 19:56:12,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1698 states, 1697 states have (on average 2.904537418974661) internal successors, (4929), 1697 states have internal predecessors, (4929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 4929 transitions.
[2021-06-05 19:56:12,281 INFO  L78                 Accepts]: Start accepts. Automaton has 1698 states and 4929 transitions. Word has length 84
[2021-06-05 19:56:12,281 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:12,282 INFO  L482      AbstractCegarLoop]: Abstraction has 1698 states and 4929 transitions.
[2021-06-05 19:56:12,282 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,282 INFO  L276                IsEmpty]: Start isEmpty. Operand 1698 states and 4929 transitions.
[2021-06-05 19:56:12,283 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:12,284 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:12,284 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:12,284 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-06-05 19:56:12,284 INFO  L430      AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:12,284 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:12,284 INFO  L82        PathProgramCache]: Analyzing trace with hash 970714149, now seen corresponding path program 7 times
[2021-06-05 19:56:12,284 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:12,284 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967154072]
[2021-06-05 19:56:12,284 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:12,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:12,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:12,435 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:12,435 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967154072]
[2021-06-05 19:56:12,435 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967154072] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:12,435 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:12,435 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-05 19:56:12,436 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474633130]
[2021-06-05 19:56:12,436 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-05 19:56:12,436 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:12,436 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-05 19:56:12,436 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:12,436 INFO  L87              Difference]: Start difference. First operand 1698 states and 4929 transitions. Second operand  has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,635 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:12,635 INFO  L93              Difference]: Finished difference Result 2883 states and 8560 transitions.
[2021-06-05 19:56:12,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-05 19:56:12,635 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-05 19:56:12,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:12,638 INFO  L225             Difference]: With dead ends: 2883
[2021-06-05 19:56:12,638 INFO  L226             Difference]: Without dead ends: 1718
[2021-06-05 19:56:12,639 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 117.6ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240
[2021-06-05 19:56:12,641 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1718 states.
[2021-06-05 19:56:12,652 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1163.
[2021-06-05 19:56:12,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1163 states, 1162 states have (on average 2.946643717728055) internal successors, (3424), 1162 states have internal predecessors, (3424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 3424 transitions.
[2021-06-05 19:56:12,654 INFO  L78                 Accepts]: Start accepts. Automaton has 1163 states and 3424 transitions. Word has length 84
[2021-06-05 19:56:12,654 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:12,654 INFO  L482      AbstractCegarLoop]: Abstraction has 1163 states and 3424 transitions.
[2021-06-05 19:56:12,654 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:12,654 INFO  L276                IsEmpty]: Start isEmpty. Operand 1163 states and 3424 transitions.
[2021-06-05 19:56:12,656 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:12,656 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:12,656 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:12,656 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-06-05 19:56:12,656 INFO  L430      AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:12,656 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:12,656 INFO  L82        PathProgramCache]: Analyzing trace with hash -1584977595, now seen corresponding path program 8 times
[2021-06-05 19:56:12,656 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:12,656 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401408688]
[2021-06-05 19:56:12,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:12,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:13,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-05 19:56:13,116 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:13,116 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401408688]
[2021-06-05 19:56:13,116 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401408688] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:13,116 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:13,116 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-05 19:56:13,117 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941803642]
[2021-06-05 19:56:13,117 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-05 19:56:13,117 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:13,117 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-05 19:56:13,117 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:13,117 INFO  L87              Difference]: Start difference. First operand 1163 states and 3424 transitions. Second operand  has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:13,652 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:13,652 INFO  L93              Difference]: Finished difference Result 2423 states and 7240 transitions.
[2021-06-05 19:56:13,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2021-06-05 19:56:13,652 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-05 19:56:13,653 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:13,654 INFO  L225             Difference]: With dead ends: 2423
[2021-06-05 19:56:13,654 INFO  L226             Difference]: Without dead ends: 923
[2021-06-05 19:56:13,654 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 642.6ms TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600
[2021-06-05 19:56:13,658 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 923 states.
[2021-06-05 19:56:13,665 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923.
[2021-06-05 19:56:13,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 923 states, 922 states have (on average 2.811279826464208) internal successors, (2592), 922 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:13,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2592 transitions.
[2021-06-05 19:56:13,667 INFO  L78                 Accepts]: Start accepts. Automaton has 923 states and 2592 transitions. Word has length 84
[2021-06-05 19:56:13,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:13,667 INFO  L482      AbstractCegarLoop]: Abstraction has 923 states and 2592 transitions.
[2021-06-05 19:56:13,667 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-05 19:56:13,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 923 states and 2592 transitions.
[2021-06-05 19:56:13,668 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:13,668 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:13,668 INFO  L554         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-05 19:56:13,668 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-06-05 19:56:13,668 INFO  L430      AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:13,669 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:13,669 INFO  L82        PathProgramCache]: Analyzing trace with hash -1003033753, now seen corresponding path program 9 times
[2021-06-05 19:56:13,669 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:13,669 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999504409]
[2021-06-05 19:56:13,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:13,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-05 19:56:13,715 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-05 19:56:13,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-05 19:56:13,768 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-05 19:56:13,805 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-05 19:56:13,806 INFO  L655         BasicCegarLoop]: Counterexample might be feasible
[2021-06-05 19:56:13,806 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-06-05 19:56:13,806 INFO  L301   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3)
[2021-06-05 19:56:13,807 INFO  L247   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-05 19:56:13,917 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:56:13 BasicIcfg
[2021-06-05 19:56:13,917 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-05 19:56:13,917 INFO  L168              Benchmark]: Toolchain (without parser) took 17362.36 ms. Allocated memory was 352.3 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 315.3 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 958.6 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:13,917 INFO  L168              Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 352.3 MB. Free memory is still 333.5 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-05 19:56:13,918 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 387.41 ms. Allocated memory is still 352.3 MB. Free memory was 315.0 MB in the beginning and 309.4 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:13,918 INFO  L168              Benchmark]: Boogie Procedure Inliner took 43.23 ms. Allocated memory is still 352.3 MB. Free memory was 309.4 MB in the beginning and 306.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:13,918 INFO  L168              Benchmark]: Boogie Preprocessor took 55.90 ms. Allocated memory is still 352.3 MB. Free memory was 306.3 MB in the beginning and 303.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:13,918 INFO  L168              Benchmark]: RCFGBuilder took 2134.14 ms. Allocated memory was 352.3 MB in the beginning and 442.5 MB in the end (delta: 90.2 MB). Free memory was 303.2 MB in the beginning and 228.3 MB in the end (delta: 74.9 MB). Peak memory consumption was 168.2 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:13,918 INFO  L168              Benchmark]: TraceAbstraction took 14737.48 ms. Allocated memory was 442.5 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 227.2 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 778.4 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:13,918 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14 ms. Allocated memory is still 352.3 MB. Free memory is still 333.5 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 387.41 ms. Allocated memory is still 352.3 MB. Free memory was 315.0 MB in the beginning and 309.4 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 43.23 ms. Allocated memory is still 352.3 MB. Free memory was 309.4 MB in the beginning and 306.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 55.90 ms. Allocated memory is still 352.3 MB. Free memory was 306.3 MB in the beginning and 303.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2134.14 ms. Allocated memory was 352.3 MB in the beginning and 442.5 MB in the end (delta: 90.2 MB). Free memory was 303.2 MB in the beginning and 228.3 MB in the end (delta: 74.9 MB). Peak memory consumption was 168.2 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 14737.48 ms. Allocated memory was 442.5 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 227.2 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 778.4 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 19]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L712]               0  int __unbuffered_p0_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L714]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0]
[L716]               0  int __unbuffered_p2_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L717]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L718]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L720]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L722]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L723]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L724]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L725]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L726]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L727]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L728]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L729]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L730]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L731]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L732]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L733]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L734]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L735]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L736]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L737]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L738]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L739]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L740]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L854]               0  pthread_t t2330;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L855]  FCALL, FORK  0  pthread_create(&t2330, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L856]               0  pthread_t t2331;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L857]  FCALL, FORK  0  pthread_create(&t2331, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L784]               2  y$w_buff1 = y$w_buff0
[L785]               2  y$w_buff0 = 2
[L786]               2  y$w_buff1_used = y$w_buff0_used
[L787]               2  y$w_buff0_used = (_Bool)1
[L19]   COND FALSE   2  !(!expression)
[L789]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L790]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L791]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L792]               2  y$r_buff1_thd3 = y$r_buff0_thd3
[L793]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L796]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L858]               0  pthread_t t2332;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L859]  FCALL, FORK  0  pthread_create(&t2332, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L813]               3  __unbuffered_p2_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L816]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L817]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L818]               3  y$flush_delayed = weak$$choice2
[L819]               3  y$mem_tmp = y
[L820]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L820]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L827]               3  __unbuffered_p2_EBX = y
[L828]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L828]               3  y = y$flush_delayed ? y$mem_tmp : y
[L829]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=50, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L744]               1  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L748]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L748]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L749]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L749]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L750]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L750]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L751]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L751]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L754]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L755]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L756]               1  y$flush_delayed = weak$$choice2
[L757]               1  y$mem_tmp = y
[L758]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L758]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L759]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L760]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L761]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L762]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L763]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765]               1  __unbuffered_p0_EAX = y
[L766]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L766]               1  y = y$flush_delayed ? y$mem_tmp : y
[L767]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=51, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L771]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L771]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L772]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L772]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L773]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L773]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L774]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L774]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L777]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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=51, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L799]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L799]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L800]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L800]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L801]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L801]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L802]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L802]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L803]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L803]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L806]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __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=51, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L832]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L832]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L833]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L833]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L834]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L834]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L835]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L835]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L836]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L836]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L839]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=51, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L861]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=51, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L4]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=51, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L866]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L867]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L867]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L868]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L868]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L869]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L869]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L872]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L873]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L874]               0  y$flush_delayed = weak$$choice2
[L875]               0  y$mem_tmp = y
[L876]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L876]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L877]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L877]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L877]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L878]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L878]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L878]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L878]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L879]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L879]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L879]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L879]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L880]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L880]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L881]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L881]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L881]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L881]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L882]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L882]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L883]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L884]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L884]               0  y = y$flush_delayed ? y$mem_tmp : y
[L885]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L19]   COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L19]                0  reach_error()
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances
    CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 960.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 179.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 779.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18166occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork2 with 1 thread instances
    CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1195.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 26.1ms, AutomataDifference: 349.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 595.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 40 SDslu, 72 SDs, 0 SdLazy, 17 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18166occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.0ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.4ms SsaConstructionTime, 28.5ms SatisfiabilityAnalysisTime, 118.2ms InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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
  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
    CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12339.5ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 123.5ms, AutomataDifference: 5635.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 573.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2632 SDtfs, 4551 SDslu, 13597 SDs, 0 SdLazy, 2491 SolverSat, 545 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2160.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 4014.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18166occurred in iteration=0, InterpolantAutomatonStates: 227, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1494.0ms AutomataMinimizationTime, 18 MinimizatonAttempts, 4072 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 60.8ms SsaConstructionTime, 879.7ms SatisfiabilityAnalysisTime, 3336.8ms InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1419 ConstructedInterpolants, 0 QuantifiedInterpolants, 11355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...