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


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


This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b
[2021-06-05 19:55:52,119 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-06-05 19:55:52,121 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-05 19:55:52,164 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-05 19:55:52,164 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-05 19:55:52,167 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-05 19:55:52,170 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-05 19:55:52,175 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-05 19:55:52,177 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-05 19:55:52,182 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-05 19:55:52,182 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-06-05 19:55:52,184 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-05 19:55:52,184 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-05 19:55:52,186 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-05 19:55:52,187 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-05 19:55:52,188 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-05 19:55:52,191 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-05 19:55:52,192 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-05 19:55:52,194 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-05 19:55:52,199 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-05 19:55:52,200 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-05 19:55:52,201 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-05 19:55:52,202 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-06-05 19:55:52,204 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-05 19:55:52,210 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-05 19:55:52,210 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-05 19:55:52,210 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-05 19:55:52,211 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-05 19:55:52,212 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-05 19:55:52,212 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-05 19:55:52,213 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-05 19:55:52,213 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-05 19:55:52,214 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-05 19:55:52,215 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-05 19:55:52,216 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-05 19:55:52,216 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-05 19:55:52,217 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-05 19:55:52,217 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-05 19:55:52,217 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-05 19:55:52,218 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-05 19:55:52,218 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-06-05 19:55:52,219 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:52,253 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-06-05 19:55:52,253 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-05 19:55:52,254 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-05 19:55:52,254 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-05 19:55:52,256 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-05 19:55:52,256 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-06-05 19:55:52,257 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-06-05 19:55:52,257 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-05 19:55:52,257 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-06-05 19:55:52,257 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-06-05 19:55:52,258 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-06-05 19:55:52,258 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-06-05 19:55:52,258 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-06-05 19:55:52,258 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-05 19:55:52,258 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-06-05 19:55:52,259 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-06-05 19:55:52,259 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-06-05 19:55:52,259 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-06-05 19:55:52,259 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-06-05 19:55:52,259 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-05 19:55:52,259 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-06-05 19:55:52,259 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-06-05 19:55:52,259 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-06-05 19:55:52,260 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-05 19:55:52,260 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-05 19:55:52,260 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-06-05 19:55:52,260 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-05 19:55:52,260 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-06-05 19:55:52,260 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-05 19:55:52,260 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-06-05 19:55:52,260 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-05 19:55:52,261 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:52,557 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-05 19:55:52,582 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-05 19:55:52,584 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-05 19:55:52,585 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-06-05 19:55:52,586 INFO  L275        PluginConnector]: CDTParser initialized
[2021-06-05 19:55:52,586 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i
[2021-06-05 19:55:52,642 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88f23b96/6f2aa4da63154a2f9bb09331f1caf4b3/FLAG0673c941e
[2021-06-05 19:55:53,116 INFO  L306              CDTParser]: Found 1 translation units.
[2021-06-05 19:55:53,116 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i
[2021-06-05 19:55:53,130 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88f23b96/6f2aa4da63154a2f9bb09331f1caf4b3/FLAG0673c941e
[2021-06-05 19:55:53,145 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88f23b96/6f2aa4da63154a2f9bb09331f1caf4b3
[2021-06-05 19:55:53,148 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-05 19:55:53,149 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-05 19:55:53,150 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-05 19:55:53,151 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-05 19:55:53,154 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-05 19:55:53,154 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:55:53" (1/1) ...
[2021-06-05 19:55:53,155 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a0bfc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:53, skipping insertion in model container
[2021-06-05 19:55:53,155 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:55:53" (1/1) ...
[2021-06-05 19:55:53,161 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-06-05 19:55:53,195 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-06-05 19:55:53,387 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_power.opt.i[994,1007]
[2021-06-05 19:55:53,592 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-05 19:55:53,599 INFO  L203         MainTranslator]: Completed pre-run
[2021-06-05 19:55:53,608 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_power.opt.i[994,1007]
[2021-06-05 19:55:53,656 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-05 19:55:53,721 INFO  L208         MainTranslator]: Completed translation
[2021-06-05 19:55:53,721 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:53 WrapperNode
[2021-06-05 19:55:53,722 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-05 19:55:53,723 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-05 19:55:53,723 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-05 19:55:53,723 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-05 19:55:53,729 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:53" (1/1) ...
[2021-06-05 19:55:53,758 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:53" (1/1) ...
[2021-06-05 19:55:53,783 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-05 19:55:53,783 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-05 19:55:53,784 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-05 19:55:53,784 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-06-05 19:55:53,790 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:53" (1/1) ...
[2021-06-05 19:55:53,791 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:53" (1/1) ...
[2021-06-05 19:55:53,795 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:53" (1/1) ...
[2021-06-05 19:55:53,795 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:53" (1/1) ...
[2021-06-05 19:55:53,807 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:53" (1/1) ...
[2021-06-05 19:55:53,811 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:53" (1/1) ...
[2021-06-05 19:55:53,815 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:53" (1/1) ...
[2021-06-05 19:55:53,821 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-05 19:55:53,822 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-05 19:55:53,822 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-06-05 19:55:53,822 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-06-05 19:55:53,823 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:53" (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:53,905 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-06-05 19:55:53,905 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-05 19:55:53,905 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-05 19:55:53,906 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-05 19:55:53,906 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-06-05 19:55:53,907 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-06-05 19:55:53,908 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-06-05 19:55:53,908 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-06-05 19:55:53,908 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-06-05 19:55:53,908 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-06-05 19:55:53,908 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-05 19:55:53,908 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-05 19:55:53,908 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-05 19:55:53,908 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-05 19:55:53,910 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:57,938 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-05 19:55:57,939 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-05 19:55:57,942 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:55:57 BoogieIcfgContainer
[2021-06-05 19:55:57,942 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-05 19:55:57,943 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-05 19:55:57,944 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-06-05 19:55:57,946 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-06-05 19:55:57,946 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:55:53" (1/3) ...
[2021-06-05 19:55:57,947 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f117bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:55:57, skipping insertion in model container
[2021-06-05 19:55:57,947 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:55:53" (2/3) ...
[2021-06-05 19:55:57,947 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f117bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:55:57, skipping insertion in model container
[2021-06-05 19:55:57,948 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:55:57" (3/3) ...
[2021-06-05 19:55:57,949 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe023_power.opt.i
[2021-06-05 19:55:57,958 WARN  L148   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-05 19:55:57,959 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-05 19:55:57,960 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-05 19:55:57,961 INFO  L471   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-05 19:55:58,026 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,026 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,026 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,026 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,026 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,026 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,027 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,027 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,028 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,028 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,028 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,028 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,028 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,028 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,029 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,030 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,030 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,030 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,030 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,030 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,030 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,030 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,030 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,030 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,031 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,031 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,031 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,031 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,031 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,032 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,034 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,034 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,034 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,036 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,036 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,036 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,037 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,038 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,038 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,038 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,038 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,038 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,038 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,038 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,038 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,039 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,039 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,039 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,039 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,039 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,039 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,039 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,039 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,039 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,040 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,040 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,040 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,041 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,042 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,045 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,050 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,050 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,051 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,056 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,056 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,056 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,056 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,057 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,057 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,058 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,058 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,058 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,058 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,058 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,062 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,062 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,062 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,063 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,063 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,063 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,063 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,063 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,063 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,063 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,063 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,064 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,064 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,064 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:58,064 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,064 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:58,064 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,064 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:58,064 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,065 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:58,065 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,065 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,065 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,065 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,065 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,065 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,065 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,066 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,066 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,067 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,067 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,067 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,067 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,067 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,067 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,068 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,068 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,068 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,068 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,068 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,068 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,068 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,069 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,069 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,069 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,069 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,070 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,070 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,070 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,070 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,070 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,070 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,070 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,071 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,071 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,071 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,071 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,071 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,071 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,071 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,071 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,071 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,072 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,073 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,073 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,073 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,073 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,073 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,073 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,073 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,074 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,074 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,074 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,074 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,074 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,076 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,077 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,078 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,078 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,078 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,079 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,080 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,080 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,080 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,084 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,084 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,084 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,093 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,093 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,093 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,094 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,094 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,094 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,094 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,098 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,099 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,100 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,101 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,102 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,102 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,102 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,103 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,104 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,105 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,109 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,109 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,109 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,110 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,111 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,111 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,113 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,114 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,114 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,115 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,116 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,116 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,116 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:58,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,117 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-05 19:55:58,118 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-05 19:55:58,136 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-05 19:55:58,149 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-05 19:55:58,149 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-05 19:55:58,149 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-05 19:55:58,149 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-05 19:55:58,149 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-05 19:55:58,149 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-05 19:55:58,150 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-05 19:55:58,150 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1========
[2021-06-05 19:55:58,158 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow
[2021-06-05 19:55:59,285 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:55:59,334 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:55:59,511 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-05 19:55:59,512 INFO  L301   ceAbstractionStarter]: Result for error location P1 was SAFE (1/3)
[2021-06-05 19:55:59,514 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-05 19:55:59,524 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-05 19:55:59,524 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-05 19:55:59,524 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-05 19:55:59,524 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-05 19:55:59,524 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-05 19:55:59,525 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-05 19:55:59,525 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-05 19:55:59,525 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork2========
[2021-06-05 19:55:59,530 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow
[2021-06-05 19:56:00,411 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,444 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,445 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2021-06-05 19:56:00,445 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:00,446 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,446 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:00,450 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:00,450 INFO  L82        PathProgramCache]: Analyzing trace with hash -865950546, now seen corresponding path program 1 times
[2021-06-05 19:56:00,457 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:00,457 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676395287]
[2021-06-05 19:56:00,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:00,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:00,744 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:00,745 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:00,745 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676395287]
[2021-06-05 19:56:00,746 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676395287] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:00,746 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:00,746 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-05 19:56:00,746 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471986521]
[2021-06-05 19:56:00,751 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-05 19:56:00,751 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:00,758 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-05 19:56:00,759 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-05 19:56:00,785 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,131 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:01,132 INFO  L93              Difference]: Finished difference Result 15583 states and 55472 transitions.
[2021-06-05 19:56:01,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-05 19:56:01,134 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,135 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:01,139 INFO  L225             Difference]: With dead ends: 15583
[2021-06-05 19:56:01,139 INFO  L226             Difference]: Without dead ends: 0
[2021-06-05 19:56:01,140 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-05 19:56:01,156 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-05 19:56:01,160 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-05 19:56:01,160 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,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-05 19:56:01,161 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49
[2021-06-05 19:56:01,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:01,162 INFO  L482      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-05 19:56:01,162 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,162 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-05 19:56:01,162 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-05 19:56:01,162 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-05 19:56:01,162 INFO  L301   ceAbstractionStarter]: Result for error location P1Thread1of1ForFork2 was SAFE (2/3)
[2021-06-05 19:56:01,163 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2021-06-05 19:56:01,164 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-05 19:56:01,164 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-05 19:56:01,164 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-05 19:56:01,164 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-05 19:56:01,164 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-05 19:56:01,164 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-05 19:56:01,164 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-05 19:56:01,164 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-05 19:56:01,166 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow
[2021-06-05 19:56:01,969 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:01,988 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:01,998 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2021-06-05 19:56:01,999 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:01,999 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:01,999 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:02,000 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:02,000 INFO  L82        PathProgramCache]: Analyzing trace with hash -64619290, now seen corresponding path program 1 times
[2021-06-05 19:56:02,000 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:02,000 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381038681]
[2021-06-05 19:56:02,000 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:02,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:02,271 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,274 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:02,274 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381038681]
[2021-06-05 19:56:02,275 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381038681] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:02,275 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:02,276 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-05 19:56:02,276 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22802408]
[2021-06-05 19:56:02,277 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-05 19:56:02,277 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:02,277 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-05 19:56:02,277 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-05 19:56:02,299 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,683 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:02,683 INFO  L93              Difference]: Finished difference Result 23998 states and 85488 transitions.
[2021-06-05 19:56:02,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:02,684 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,685 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:02,756 INFO  L225             Difference]: With dead ends: 23998
[2021-06-05 19:56:02,756 INFO  L226             Difference]: Without dead ends: 9418
[2021-06-05 19:56:02,757 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 147.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:02,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9418 states.
[2021-06-05 19:56:03,175 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9418 to 9418.
[2021-06-05 19:56:03,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9418 states, 9416 states have (on average 3.49607051826678) internal successors, (32919), 9417 states have internal predecessors, (32919), 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,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9418 states to 9418 states and 32919 transitions.
[2021-06-05 19:56:03,270 INFO  L78                 Accepts]: Start accepts. Automaton has 9418 states and 32919 transitions. Word has length 68
[2021-06-05 19:56:03,271 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:03,271 INFO  L482      AbstractCegarLoop]: Abstraction has 9418 states and 32919 transitions.
[2021-06-05 19:56:03,271 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:03,271 INFO  L276                IsEmpty]: Start isEmpty. Operand 9418 states and 32919 transitions.
[2021-06-05 19:56:03,290 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2021-06-05 19:56:03,291 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:03,291 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]
[2021-06-05 19:56:03,291 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-05 19:56:03,291 INFO  L430      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:03,292 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:03,292 INFO  L82        PathProgramCache]: Analyzing trace with hash -1523198617, now seen corresponding path program 1 times
[2021-06-05 19:56:03,292 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:03,292 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435302574]
[2021-06-05 19:56:03,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:03,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:03,504 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,505 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:03,505 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435302574]
[2021-06-05 19:56:03,505 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435302574] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:03,505 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:03,505 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-05 19:56:03,505 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383264053]
[2021-06-05 19:56:03,506 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-05 19:56:03,507 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:03,508 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-05 19:56:03,508 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-05 19:56:03,508 INFO  L87              Difference]: Start difference. First operand 9418 states and 32919 transitions. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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,871 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:03,872 INFO  L93              Difference]: Finished difference Result 12496 states and 43404 transitions.
[2021-06-05 19:56:03,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-05 19:56:03,872 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 70
[2021-06-05 19:56:03,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:03,906 INFO  L225             Difference]: With dead ends: 12496
[2021-06-05 19:56:03,906 INFO  L226             Difference]: Without dead ends: 5953
[2021-06-05 19:56:03,907 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 169.6ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2021-06-05 19:56:03,931 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5953 states.
[2021-06-05 19:56:04,066 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 5953.
[2021-06-05 19:56:04,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5953 states, 5952 states have (on average 3.3665994623655915) internal successors, (20038), 5952 states have internal predecessors, (20038), 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,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5953 states to 5953 states and 20038 transitions.
[2021-06-05 19:56:04,096 INFO  L78                 Accepts]: Start accepts. Automaton has 5953 states and 20038 transitions. Word has length 70
[2021-06-05 19:56:04,097 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:04,097 INFO  L482      AbstractCegarLoop]: Abstraction has 5953 states and 20038 transitions.
[2021-06-05 19:56:04,097 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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,097 INFO  L276                IsEmpty]: Start isEmpty. Operand 5953 states and 20038 transitions.
[2021-06-05 19:56:04,107 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2021-06-05 19:56:04,107 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:04,107 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]
[2021-06-05 19:56:04,107 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-05 19:56:04,107 INFO  L430      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:04,108 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:04,108 INFO  L82        PathProgramCache]: Analyzing trace with hash -1417215106, now seen corresponding path program 1 times
[2021-06-05 19:56:04,108 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:04,108 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530750887]
[2021-06-05 19:56:04,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:04,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:04,265 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,265 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:04,265 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530750887]
[2021-06-05 19:56:04,265 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530750887] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:04,265 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:04,265 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-05 19:56:04,266 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983253489]
[2021-06-05 19:56:04,266 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-05 19:56:04,266 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:04,266 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-05 19:56:04,267 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-05 19:56:04,267 INFO  L87              Difference]: Start difference. First operand 5953 states and 20038 transitions. Second operand  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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,407 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:04,407 INFO  L93              Difference]: Finished difference Result 6313 states and 21076 transitions.
[2021-06-05 19:56:04,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:04,408 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 73
[2021-06-05 19:56:04,408 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:04,425 INFO  L225             Difference]: With dead ends: 6313
[2021-06-05 19:56:04,425 INFO  L226             Difference]: Without dead ends: 5233
[2021-06-05 19:56:04,426 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 94.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:04,445 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5233 states.
[2021-06-05 19:56:04,600 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 5233.
[2021-06-05 19:56:04,607 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,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 17422 transitions.
[2021-06-05 19:56:04,623 INFO  L78                 Accepts]: Start accepts. Automaton has 5233 states and 17422 transitions. Word has length 73
[2021-06-05 19:56:04,623 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:04,623 INFO  L482      AbstractCegarLoop]: Abstraction has 5233 states and 17422 transitions.
[2021-06-05 19:56:04,623 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 5233 states and 17422 transitions.
[2021-06-05 19:56:04,633 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2021-06-05 19:56:04,633 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:04,633 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,633 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-05 19:56:04,633 INFO  L430      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:04,634 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:04,634 INFO  L82        PathProgramCache]: Analyzing trace with hash -2052241606, now seen corresponding path program 1 times
[2021-06-05 19:56:04,634 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:04,634 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322825471]
[2021-06-05 19:56:04,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:04,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:04,898 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,899 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:04,899 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322825471]
[2021-06-05 19:56:04,899 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322825471] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:04,899 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:04,899 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-05 19:56:04,899 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803388064]
[2021-06-05 19:56:04,900 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-05 19:56:04,900 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:04,900 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-05 19:56:04,900 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2021-06-05 19:56:04,901 INFO  L87              Difference]: Start difference. First operand 5233 states and 17422 transitions. Second operand  has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 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,451 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:05,451 INFO  L93              Difference]: Finished difference Result 6719 states and 22349 transitions.
[2021-06-05 19:56:05,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2021-06-05 19:56:05,452 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 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,453 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:05,472 INFO  L225             Difference]: With dead ends: 6719
[2021-06-05 19:56:05,472 INFO  L226             Difference]: Without dead ends: 6099
[2021-06-05 19:56:05,473 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 244.8ms TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420
[2021-06-05 19:56:05,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6099 states.
[2021-06-05 19:56:05,675 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6099 to 5615.
[2021-06-05 19:56:05,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5615 states, 5614 states have (on average 3.326861417883862) internal successors, (18677), 5614 states have internal predecessors, (18677), 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,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 18677 transitions.
[2021-06-05 19:56:05,697 INFO  L78                 Accepts]: Start accepts. Automaton has 5615 states and 18677 transitions. Word has length 77
[2021-06-05 19:56:05,697 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:05,697 INFO  L482      AbstractCegarLoop]: Abstraction has 5615 states and 18677 transitions.
[2021-06-05 19:56:05,697 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 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,698 INFO  L276                IsEmpty]: Start isEmpty. Operand 5615 states and 18677 transitions.
[2021-06-05 19:56:05,707 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2021-06-05 19:56:05,707 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:05,707 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,707 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-05 19:56:05,707 INFO  L430      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:05,708 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:05,708 INFO  L82        PathProgramCache]: Analyzing trace with hash 1192464058, now seen corresponding path program 2 times
[2021-06-05 19:56:05,708 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:05,708 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031850765]
[2021-06-05 19:56:05,708 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:05,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:06,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:06,098 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:06,098 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031850765]
[2021-06-05 19:56:06,098 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031850765] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:06,098 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:06,098 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-05 19:56:06,098 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773505093]
[2021-06-05 19:56:06,098 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-05 19:56:06,099 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:06,099 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-05 19:56:06,099 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:06,099 INFO  L87              Difference]: Start difference. First operand 5615 states and 18677 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,615 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:06,615 INFO  L93              Difference]: Finished difference Result 6628 states and 21989 transitions.
[2021-06-05 19:56:06,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-05 19:56:06,616 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,616 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:06,634 INFO  L225             Difference]: With dead ends: 6628
[2021-06-05 19:56:06,634 INFO  L226             Difference]: Without dead ends: 6028
[2021-06-05 19:56:06,634 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 406.9ms TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462
[2021-06-05 19:56:06,653 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6028 states.
[2021-06-05 19:56:06,804 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 5646.
[2021-06-05 19:56:06,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5646 states, 5645 states have (on average 3.333746678476528) internal successors, (18819), 5645 states have internal predecessors, (18819), 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,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 18819 transitions.
[2021-06-05 19:56:06,829 INFO  L78                 Accepts]: Start accepts. Automaton has 5646 states and 18819 transitions. Word has length 77
[2021-06-05 19:56:06,830 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:06,830 INFO  L482      AbstractCegarLoop]: Abstraction has 5646 states and 18819 transitions.
[2021-06-05 19:56:06,830 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,830 INFO  L276                IsEmpty]: Start isEmpty. Operand 5646 states and 18819 transitions.
[2021-06-05 19:56:06,840 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2021-06-05 19:56:06,840 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:06,840 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:06,840 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-05 19:56:06,841 INFO  L430      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:06,841 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:06,841 INFO  L82        PathProgramCache]: Analyzing trace with hash 387054042, now seen corresponding path program 3 times
[2021-06-05 19:56:06,841 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:06,841 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204455384]
[2021-06-05 19:56:06,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:06,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:07,270 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,270 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:07,270 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204455384]
[2021-06-05 19:56:07,270 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204455384] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:07,270 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:07,270 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-05 19:56:07,271 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397979978]
[2021-06-05 19:56:07,271 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-05 19:56:07,271 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:07,271 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-05 19:56:07,271 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:07,272 INFO  L87              Difference]: Start difference. First operand 5646 states and 18819 transitions. Second operand  has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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:07,823 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:07,823 INFO  L93              Difference]: Finished difference Result 9323 states and 31028 transitions.
[2021-06-05 19:56:07,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-05 19:56:07,824 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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:07,824 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:07,842 INFO  L225             Difference]: With dead ends: 9323
[2021-06-05 19:56:07,842 INFO  L226             Difference]: Without dead ends: 6847
[2021-06-05 19:56:07,842 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 320.4ms TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342
[2021-06-05 19:56:07,862 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6847 states.
[2021-06-05 19:56:07,983 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6847 to 6434.
[2021-06-05 19:56:07,993 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6434 states, 6433 states have (on average 3.3172703248873) internal successors, (21340), 6433 states have internal predecessors, (21340), 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,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6434 states to 6434 states and 21340 transitions.
[2021-06-05 19:56:08,015 INFO  L78                 Accepts]: Start accepts. Automaton has 6434 states and 21340 transitions. Word has length 77
[2021-06-05 19:56:08,016 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:08,016 INFO  L482      AbstractCegarLoop]: Abstraction has 6434 states and 21340 transitions.
[2021-06-05 19:56:08,016 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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:08,016 INFO  L276                IsEmpty]: Start isEmpty. Operand 6434 states and 21340 transitions.
[2021-06-05 19:56:08,030 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-06-05 19:56:08,030 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:08,030 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:08,030 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-05 19:56:08,030 INFO  L430      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:08,031 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:08,031 INFO  L82        PathProgramCache]: Analyzing trace with hash -2103354662, now seen corresponding path program 1 times
[2021-06-05 19:56:08,031 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:08,031 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723594039]
[2021-06-05 19:56:08,031 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:08,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:08,321 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,321 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:08,323 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723594039]
[2021-06-05 19:56:08,323 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723594039] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:08,323 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:08,323 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-05 19:56:08,323 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432237803]
[2021-06-05 19:56:08,324 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-05 19:56:08,324 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:08,324 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-05 19:56:08,324 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2021-06-05 19:56:08,324 INFO  L87              Difference]: Start difference. First operand 6434 states and 21340 transitions. Second operand  has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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:08,861 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:08,861 INFO  L93              Difference]: Finished difference Result 7589 states and 25199 transitions.
[2021-06-05 19:56:08,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2021-06-05 19:56:08,862 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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:08,862 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:08,881 INFO  L225             Difference]: With dead ends: 7589
[2021-06-05 19:56:08,881 INFO  L226             Difference]: Without dead ends: 6913
[2021-06-05 19:56:08,882 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 337.6ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272
[2021-06-05 19:56:08,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6913 states.
[2021-06-05 19:56:09,042 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6795.
[2021-06-05 19:56:09,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6795 states, 6794 states have (on average 3.3257285840447453) internal successors, (22595), 6794 states have internal predecessors, (22595), 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,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6795 states to 6795 states and 22595 transitions.
[2021-06-05 19:56:09,076 INFO  L78                 Accepts]: Start accepts. Automaton has 6795 states and 22595 transitions. Word has length 78
[2021-06-05 19:56:09,076 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:09,076 INFO  L482      AbstractCegarLoop]: Abstraction has 6795 states and 22595 transitions.
[2021-06-05 19:56:09,076 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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:09,076 INFO  L276                IsEmpty]: Start isEmpty. Operand 6795 states and 22595 transitions.
[2021-06-05 19:56:09,089 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-06-05 19:56:09,089 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:09,089 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:09,089 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-05 19:56:09,090 INFO  L430      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:09,090 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:09,090 INFO  L82        PathProgramCache]: Analyzing trace with hash 6401276, now seen corresponding path program 2 times
[2021-06-05 19:56:09,090 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:09,090 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134398383]
[2021-06-05 19:56:09,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:09,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:09,252 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,252 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:09,252 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134398383]
[2021-06-05 19:56:09,252 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134398383] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:09,252 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:09,253 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-05 19:56:09,253 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475073670]
[2021-06-05 19:56:09,253 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-05 19:56:09,253 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:09,253 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-05 19:56:09,254 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-05 19:56:09,254 INFO  L87              Difference]: Start difference. First operand 6795 states and 22595 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:09,397 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:09,397 INFO  L93              Difference]: Finished difference Result 8249 states and 27066 transitions.
[2021-06-05 19:56:09,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:09,398 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:09,398 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:09,412 INFO  L225             Difference]: With dead ends: 8249
[2021-06-05 19:56:09,413 INFO  L226             Difference]: Without dead ends: 5985
[2021-06-05 19:56:09,416 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 88.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:09,433 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5985 states.
[2021-06-05 19:56:09,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 5982.
[2021-06-05 19:56:09,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5982 states, 5981 states have (on average 3.2563116535696373) internal successors, (19476), 5981 states have internal predecessors, (19476), 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,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5982 states to 5982 states and 19476 transitions.
[2021-06-05 19:56:09,581 INFO  L78                 Accepts]: Start accepts. Automaton has 5982 states and 19476 transitions. Word has length 78
[2021-06-05 19:56:09,581 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:09,581 INFO  L482      AbstractCegarLoop]: Abstraction has 5982 states and 19476 transitions.
[2021-06-05 19:56:09,582 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:09,582 INFO  L276                IsEmpty]: Start isEmpty. Operand 5982 states and 19476 transitions.
[2021-06-05 19:56:09,597 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-06-05 19:56:09,597 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:09,598 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:09,598 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-05 19:56:09,598 INFO  L430      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:09,598 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:09,598 INFO  L82        PathProgramCache]: Analyzing trace with hash -2132362663, now seen corresponding path program 1 times
[2021-06-05 19:56:09,598 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:09,598 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866019988]
[2021-06-05 19:56:09,599 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:09,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:09,729 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,729 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:09,729 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866019988]
[2021-06-05 19:56:09,729 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866019988] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:09,729 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:09,729 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-05 19:56:09,729 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823841679]
[2021-06-05 19:56:09,730 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-05 19:56:09,730 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:09,731 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-05 19:56:09,731 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-05 19:56:09,731 INFO  L87              Difference]: Start difference. First operand 5982 states and 19476 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:09,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:09,880 INFO  L93              Difference]: Finished difference Result 5910 states and 18798 transitions.
[2021-06-05 19:56:09,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-05 19:56:09,880 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:09,881 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:09,889 INFO  L225             Difference]: With dead ends: 5910
[2021-06-05 19:56:09,889 INFO  L226             Difference]: Without dead ends: 4146
[2021-06-05 19:56:09,890 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 108.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-05 19:56:09,901 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4146 states.
[2021-06-05 19:56:09,977 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 4037.
[2021-06-05 19:56:09,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4037 states, 4036 states have (on average 3.1005946481665014) internal successors, (12514), 4036 states have internal predecessors, (12514), 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,993 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4037 states to 4037 states and 12514 transitions.
[2021-06-05 19:56:09,994 INFO  L78                 Accepts]: Start accepts. Automaton has 4037 states and 12514 transitions. Word has length 79
[2021-06-05 19:56:09,994 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:09,994 INFO  L482      AbstractCegarLoop]: Abstraction has 4037 states and 12514 transitions.
[2021-06-05 19:56:09,994 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:09,994 INFO  L276                IsEmpty]: Start isEmpty. Operand 4037 states and 12514 transitions.
[2021-06-05 19:56:10,000 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-06-05 19:56:10,001 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:10,001 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:10,001 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-05 19:56:10,001 INFO  L430      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:10,001 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:10,002 INFO  L82        PathProgramCache]: Analyzing trace with hash -1983514022, now seen corresponding path program 1 times
[2021-06-05 19:56:10,002 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:10,002 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790452727]
[2021-06-05 19:56:10,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:10,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:10,271 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,271 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:10,271 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790452727]
[2021-06-05 19:56:10,271 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790452727] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:10,271 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:10,271 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-05 19:56:10,272 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711907066]
[2021-06-05 19:56:10,272 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-05 19:56:10,272 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:10,272 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-05 19:56:10,272 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2021-06-05 19:56:10,273 INFO  L87              Difference]: Start difference. First operand 4037 states and 12514 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:10,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:10,688 INFO  L93              Difference]: Finished difference Result 5575 states and 17325 transitions.
[2021-06-05 19:56:10,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-05 19:56:10,689 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:10,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:10,696 INFO  L225             Difference]: With dead ends: 5575
[2021-06-05 19:56:10,697 INFO  L226             Difference]: Without dead ends: 4037
[2021-06-05 19:56:10,697 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 272.2ms TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240
[2021-06-05 19:56:10,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4037 states.
[2021-06-05 19:56:10,777 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 4037.
[2021-06-05 19:56:10,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4037 states, 4036 states have (on average 3.084737363726462) internal successors, (12450), 4036 states have internal predecessors, (12450), 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,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4037 states to 4037 states and 12450 transitions.
[2021-06-05 19:56:10,793 INFO  L78                 Accepts]: Start accepts. Automaton has 4037 states and 12450 transitions. Word has length 81
[2021-06-05 19:56:10,794 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:10,794 INFO  L482      AbstractCegarLoop]: Abstraction has 4037 states and 12450 transitions.
[2021-06-05 19:56:10,794 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:10,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 4037 states and 12450 transitions.
[2021-06-05 19:56:10,800 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-06-05 19:56:10,800 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:10,800 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:10,801 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-05 19:56:10,801 INFO  L430      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:10,801 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:10,801 INFO  L82        PathProgramCache]: Analyzing trace with hash -1707571174, now seen corresponding path program 2 times
[2021-06-05 19:56:10,801 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:10,801 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170754036]
[2021-06-05 19:56:10,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:10,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:10,953 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,953 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:10,954 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170754036]
[2021-06-05 19:56:10,954 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170754036] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:10,954 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:10,954 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-05 19:56:10,954 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122815738]
[2021-06-05 19:56:10,955 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-05 19:56:10,955 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:10,955 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-05 19:56:10,955 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-05 19:56:10,955 INFO  L87              Difference]: Start difference. First operand 4037 states and 12450 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:11,099 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:11,100 INFO  L93              Difference]: Finished difference Result 3461 states and 10467 transitions.
[2021-06-05 19:56:11,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-05 19:56:11,100 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:11,100 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:11,105 INFO  L225             Difference]: With dead ends: 3461
[2021-06-05 19:56:11,105 INFO  L226             Difference]: Without dead ends: 2741
[2021-06-05 19:56:11,105 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 116.4ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:11,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2741 states.
[2021-06-05 19:56:11,152 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2205.
[2021-06-05 19:56:11,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2205 states, 2204 states have (on average 2.9455535390199636) internal successors, (6492), 2204 states have internal predecessors, (6492), 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,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 6492 transitions.
[2021-06-05 19:56:11,159 INFO  L78                 Accepts]: Start accepts. Automaton has 2205 states and 6492 transitions. Word has length 81
[2021-06-05 19:56:11,159 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:11,159 INFO  L482      AbstractCegarLoop]: Abstraction has 2205 states and 6492 transitions.
[2021-06-05 19:56:11,160 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:11,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 2205 states and 6492 transitions.
[2021-06-05 19:56:11,163 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:11,163 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:11,163 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,163 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-05 19:56:11,163 INFO  L430      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:11,164 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:11,164 INFO  L82        PathProgramCache]: Analyzing trace with hash -1806497211, now seen corresponding path program 1 times
[2021-06-05 19:56:11,164 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:11,164 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027321365]
[2021-06-05 19:56:11,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:11,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:11,367 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,367 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:11,367 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027321365]
[2021-06-05 19:56:11,367 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027321365] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:11,367 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:11,367 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-05 19:56:11,367 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944648587]
[2021-06-05 19:56:11,368 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-05 19:56:11,368 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:11,369 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-05 19:56:11,369 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2021-06-05 19:56:11,369 INFO  L87              Difference]: Start difference. First operand 2205 states and 6492 transitions. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:11,596 INFO  L93              Difference]: Finished difference Result 3561 states and 10533 transitions.
[2021-06-05 19:56:11,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:11,597 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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,597 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:11,601 INFO  L225             Difference]: With dead ends: 3561
[2021-06-05 19:56:11,601 INFO  L226             Difference]: Without dead ends: 2443
[2021-06-05 19:56:11,601 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 113.7ms TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2021-06-05 19:56:11,606 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2443 states.
[2021-06-05 19:56:11,637 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2443.
[2021-06-05 19:56:11,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2443 states, 2442 states have (on average 2.9070434070434072) internal successors, (7099), 2442 states have internal predecessors, (7099), 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,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 7099 transitions.
[2021-06-05 19:56:11,644 INFO  L78                 Accepts]: Start accepts. Automaton has 2443 states and 7099 transitions. Word has length 84
[2021-06-05 19:56:11,644 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:11,644 INFO  L482      AbstractCegarLoop]: Abstraction has 2443 states and 7099 transitions.
[2021-06-05 19:56:11,644 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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,645 INFO  L276                IsEmpty]: Start isEmpty. Operand 2443 states and 7099 transitions.
[2021-06-05 19:56:11,648 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:11,648 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:11,648 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,648 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-05 19:56:11,648 INFO  L430      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:11,648 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:11,649 INFO  L82        PathProgramCache]: Analyzing trace with hash -1526451131, now seen corresponding path program 2 times
[2021-06-05 19:56:11,649 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:11,649 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048609773]
[2021-06-05 19:56:11,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:11,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:11,843 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,843 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:11,843 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048609773]
[2021-06-05 19:56:11,843 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048609773] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:11,843 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:11,843 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-05 19:56:11,844 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830823615]
[2021-06-05 19:56:11,844 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-05 19:56:11,844 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:11,844 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-05 19:56:11,844 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2021-06-05 19:56:11,844 INFO  L87              Difference]: Start difference. First operand 2443 states and 7099 transitions. Second operand  has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:12,130 INFO  L93              Difference]: Finished difference Result 3384 states and 10033 transitions.
[2021-06-05 19:56:12,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-05 19:56:12,130 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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,130 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:12,134 INFO  L225             Difference]: With dead ends: 3384
[2021-06-05 19:56:12,134 INFO  L226             Difference]: Without dead ends: 2251
[2021-06-05 19:56:12,134 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 132.4ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272
[2021-06-05 19:56:12,138 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2251 states.
[2021-06-05 19:56:12,163 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2224.
[2021-06-05 19:56:12,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2224 states, 2223 states have (on average 2.935222672064777) internal successors, (6525), 2223 states have internal predecessors, (6525), 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,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 6525 transitions.
[2021-06-05 19:56:12,170 INFO  L78                 Accepts]: Start accepts. Automaton has 2224 states and 6525 transitions. Word has length 84
[2021-06-05 19:56:12,170 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:12,170 INFO  L482      AbstractCegarLoop]: Abstraction has 2224 states and 6525 transitions.
[2021-06-05 19:56:12,170 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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,170 INFO  L276                IsEmpty]: Start isEmpty. Operand 2224 states and 6525 transitions.
[2021-06-05 19:56:12,173 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:12,173 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:12,173 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,173 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-05 19:56:12,173 INFO  L430      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:12,174 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:12,174 INFO  L82        PathProgramCache]: Analyzing trace with hash -723221023, now seen corresponding path program 3 times
[2021-06-05 19:56:12,174 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:12,174 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676486714]
[2021-06-05 19:56:12,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:12,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:12,495 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,496 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:12,496 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676486714]
[2021-06-05 19:56:12,496 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676486714] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:12,496 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:12,496 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-05 19:56:12,496 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850709568]
[2021-06-05 19:56:12,496 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-05 19:56:12,497 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:12,497 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-05 19:56:12,497 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:12,497 INFO  L87              Difference]: Start difference. First operand 2224 states and 6525 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,682 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:12,683 INFO  L93              Difference]: Finished difference Result 3019 states and 8975 transitions.
[2021-06-05 19:56:12,683 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-05 19:56:12,683 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,683 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:12,686 INFO  L225             Difference]: With dead ends: 3019
[2021-06-05 19:56:12,686 INFO  L226             Difference]: Without dead ends: 2189
[2021-06-05 19:56:12,687 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 160.5ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182
[2021-06-05 19:56:12,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2189 states.
[2021-06-05 19:56:12,722 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1904.
[2021-06-05 19:56:12,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1904 states, 1903 states have (on average 2.8675775091960065) internal successors, (5457), 1903 states have internal predecessors, (5457), 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,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 5457 transitions.
[2021-06-05 19:56:12,729 INFO  L78                 Accepts]: Start accepts. Automaton has 1904 states and 5457 transitions. Word has length 84
[2021-06-05 19:56:12,729 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:12,729 INFO  L482      AbstractCegarLoop]: Abstraction has 1904 states and 5457 transitions.
[2021-06-05 19:56:12,729 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,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 1904 states and 5457 transitions.
[2021-06-05 19:56:12,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:12,733 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:12,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:12,733 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-06-05 19:56:12,733 INFO  L430      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:12,733 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:12,734 INFO  L82        PathProgramCache]: Analyzing trace with hash 369412291, now seen corresponding path program 4 times
[2021-06-05 19:56:12,734 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:12,734 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223203690]
[2021-06-05 19:56:12,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:12,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:13,125 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,125 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:13,125 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223203690]
[2021-06-05 19:56:13,127 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223203690] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:13,127 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:13,127 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-05 19:56:13,127 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140497947]
[2021-06-05 19:56:13,128 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-05 19:56:13,128 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:13,128 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-05 19:56:13,129 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:13,129 INFO  L87              Difference]: Start difference. First operand 1904 states and 5457 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,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:13,586 INFO  L93              Difference]: Finished difference Result 2798 states and 8133 transitions.
[2021-06-05 19:56:13,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-05 19:56:13,587 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,587 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:13,590 INFO  L225             Difference]: With dead ends: 2798
[2021-06-05 19:56:13,590 INFO  L226             Difference]: Without dead ends: 1900
[2021-06-05 19:56:13,591 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 405.4ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420
[2021-06-05 19:56:13,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1900 states.
[2021-06-05 19:56:13,625 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1900.
[2021-06-05 19:56:13,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1900 states, 1899 states have (on average 2.865192206424434) internal successors, (5441), 1899 states have internal predecessors, (5441), 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,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 5441 transitions.
[2021-06-05 19:56:13,632 INFO  L78                 Accepts]: Start accepts. Automaton has 1900 states and 5441 transitions. Word has length 84
[2021-06-05 19:56:13,632 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:13,632 INFO  L482      AbstractCegarLoop]: Abstraction has 1900 states and 5441 transitions.
[2021-06-05 19:56:13,632 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,633 INFO  L276                IsEmpty]: Start isEmpty. Operand 1900 states and 5441 transitions.
[2021-06-05 19:56:13,635 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:13,636 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:13,636 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,636 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-06-05 19:56:13,636 INFO  L430      AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:13,636 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:13,636 INFO  L82        PathProgramCache]: Analyzing trace with hash -864246077, now seen corresponding path program 5 times
[2021-06-05 19:56:13,637 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:13,637 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738764757]
[2021-06-05 19:56:13,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:13,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:14,026 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:14,027 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:14,027 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738764757]
[2021-06-05 19:56:14,027 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738764757] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:14,027 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:14,027 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-06-05 19:56:14,027 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778247373]
[2021-06-05 19:56:14,028 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 16 states
[2021-06-05 19:56:14,028 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:14,028 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-06-05 19:56:14,028 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240
[2021-06-05 19:56:14,028 INFO  L87              Difference]: Start difference. First operand 1900 states and 5441 transitions. Second operand  has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 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:14,461 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:14,461 INFO  L93              Difference]: Finished difference Result 2722 states and 7809 transitions.
[2021-06-05 19:56:14,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-05 19:56:14,461 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 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:14,462 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:14,464 INFO  L225             Difference]: With dead ends: 2722
[2021-06-05 19:56:14,465 INFO  L226             Difference]: Without dead ends: 1718
[2021-06-05 19:56:14,465 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 430.3ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420
[2021-06-05 19:56:14,469 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1718 states.
[2021-06-05 19:56:14,492 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718.
[2021-06-05 19:56:14,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1718 states, 1717 states have (on average 2.87361677344205) internal successors, (4934), 1717 states have internal predecessors, (4934), 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:14,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 4934 transitions.
[2021-06-05 19:56:14,497 INFO  L78                 Accepts]: Start accepts. Automaton has 1718 states and 4934 transitions. Word has length 84
[2021-06-05 19:56:14,497 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:14,497 INFO  L482      AbstractCegarLoop]: Abstraction has 1718 states and 4934 transitions.
[2021-06-05 19:56:14,498 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 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:14,498 INFO  L276                IsEmpty]: Start isEmpty. Operand 1718 states and 4934 transitions.
[2021-06-05 19:56:14,500 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:14,500 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:14,500 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:14,500 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-06-05 19:56:14,500 INFO  L430      AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:14,501 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:14,501 INFO  L82        PathProgramCache]: Analyzing trace with hash -628878427, now seen corresponding path program 6 times
[2021-06-05 19:56:14,501 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:14,501 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222628740]
[2021-06-05 19:56:14,501 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:14,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:14,702 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:14,702 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:14,703 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222628740]
[2021-06-05 19:56:14,703 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222628740] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:14,703 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:14,703 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-05 19:56:14,703 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549986411]
[2021-06-05 19:56:14,703 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-05 19:56:14,704 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:14,704 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-05 19:56:14,704 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2021-06-05 19:56:14,704 INFO  L87              Difference]: Start difference. First operand 1718 states and 4934 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:14,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:14,994 INFO  L93              Difference]: Finished difference Result 3687 states and 10966 transitions.
[2021-06-05 19:56:14,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-05 19:56:14,994 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:14,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:14,998 INFO  L225             Difference]: With dead ends: 3687
[2021-06-05 19:56:14,998 INFO  L226             Difference]: Without dead ends: 1901
[2021-06-05 19:56:14,999 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 173.5ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240
[2021-06-05 19:56:15,002 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1901 states.
[2021-06-05 19:56:15,024 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1346.
[2021-06-05 19:56:15,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1346 states, 1345 states have (on average 2.828996282527881) internal successors, (3805), 1345 states have internal predecessors, (3805), 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:15,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 3805 transitions.
[2021-06-05 19:56:15,028 INFO  L78                 Accepts]: Start accepts. Automaton has 1346 states and 3805 transitions. Word has length 84
[2021-06-05 19:56:15,028 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:15,029 INFO  L482      AbstractCegarLoop]: Abstraction has 1346 states and 3805 transitions.
[2021-06-05 19:56:15,029 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:15,029 INFO  L276                IsEmpty]: Start isEmpty. Operand 1346 states and 3805 transitions.
[2021-06-05 19:56:15,031 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:15,031 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:15,031 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:15,031 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-06-05 19:56:15,031 INFO  L430      AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:15,031 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:15,032 INFO  L82        PathProgramCache]: Analyzing trace with hash 970714149, now seen corresponding path program 7 times
[2021-06-05 19:56:15,032 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:15,032 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081115915]
[2021-06-05 19:56:15,032 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:15,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:15,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:15,573 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:15,573 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081115915]
[2021-06-05 19:56:15,573 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081115915] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:15,574 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:15,574 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-05 19:56:15,574 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043177930]
[2021-06-05 19:56:15,574 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-05 19:56:15,574 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:15,574 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-05 19:56:15,575 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210
[2021-06-05 19:56:15,575 INFO  L87              Difference]: Start difference. First operand 1346 states and 3805 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:16,127 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:16,127 INFO  L93              Difference]: Finished difference Result 2660 states and 7783 transitions.
[2021-06-05 19:56:16,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-05 19:56:16,128 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:16,128 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:16,131 INFO  L225             Difference]: With dead ends: 2660
[2021-06-05 19:56:16,131 INFO  L226             Difference]: Without dead ends: 1842
[2021-06-05 19:56:16,131 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 571.3ms TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342
[2021-06-05 19:56:16,135 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1842 states.
[2021-06-05 19:56:16,153 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1218.
[2021-06-05 19:56:16,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1218 states, 1217 states have (on average 2.80936729663106) internal successors, (3419), 1217 states have internal predecessors, (3419), 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:16,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 3419 transitions.
[2021-06-05 19:56:16,157 INFO  L78                 Accepts]: Start accepts. Automaton has 1218 states and 3419 transitions. Word has length 84
[2021-06-05 19:56:16,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:16,157 INFO  L482      AbstractCegarLoop]: Abstraction has 1218 states and 3419 transitions.
[2021-06-05 19:56:16,157 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:16,157 INFO  L276                IsEmpty]: Start isEmpty. Operand 1218 states and 3419 transitions.
[2021-06-05 19:56:16,159 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:16,159 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:16,160 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:16,160 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-06-05 19:56:16,160 INFO  L430      AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:16,160 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:16,160 INFO  L82        PathProgramCache]: Analyzing trace with hash 545767459, now seen corresponding path program 8 times
[2021-06-05 19:56:16,160 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:16,160 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089233229]
[2021-06-05 19:56:16,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:16,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:16,511 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:16,511 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:16,511 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089233229]
[2021-06-05 19:56:16,511 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089233229] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:16,511 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:16,511 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-06-05 19:56:16,511 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673754761]
[2021-06-05 19:56:16,512 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 14 states
[2021-06-05 19:56:16,513 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:16,513 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-06-05 19:56:16,513 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2021-06-05 19:56:16,514 INFO  L87              Difference]: Start difference. First operand 1218 states and 3419 transitions. Second operand  has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 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:16,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:16,923 INFO  L93              Difference]: Finished difference Result 2931 states and 8599 transitions.
[2021-06-05 19:56:16,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-06-05 19:56:16,923 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 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:16,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:16,927 INFO  L225             Difference]: With dead ends: 2931
[2021-06-05 19:56:16,928 INFO  L226             Difference]: Without dead ends: 2210
[2021-06-05 19:56:16,928 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 383.1ms TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380
[2021-06-05 19:56:16,933 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2210 states.
[2021-06-05 19:56:16,953 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 1067.
[2021-06-05 19:56:16,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1067 states, 1066 states have (on average 2.8536585365853657) internal successors, (3042), 1066 states have internal predecessors, (3042), 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:16,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3042 transitions.
[2021-06-05 19:56:16,957 INFO  L78                 Accepts]: Start accepts. Automaton has 1067 states and 3042 transitions. Word has length 84
[2021-06-05 19:56:16,957 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:16,957 INFO  L482      AbstractCegarLoop]: Abstraction has 1067 states and 3042 transitions.
[2021-06-05 19:56:16,957 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 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:16,958 INFO  L276                IsEmpty]: Start isEmpty. Operand 1067 states and 3042 transitions.
[2021-06-05 19:56:16,959 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:16,959 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:16,959 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:16,959 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-06-05 19:56:16,960 INFO  L430      AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:16,960 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:16,960 INFO  L82        PathProgramCache]: Analyzing trace with hash -1584977595, now seen corresponding path program 9 times
[2021-06-05 19:56:16,960 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:16,960 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903102894]
[2021-06-05 19:56:16,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:17,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-05 19:56:17,425 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:17,425 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-05 19:56:17,425 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903102894]
[2021-06-05 19:56:17,425 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903102894] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-05 19:56:17,426 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-05 19:56:17,426 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-06-05 19:56:17,426 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659480385]
[2021-06-05 19:56:17,426 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 14 states
[2021-06-05 19:56:17,426 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-05 19:56:17,427 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-06-05 19:56:17,427 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2021-06-05 19:56:17,427 INFO  L87              Difference]: Start difference. First operand 1067 states and 3042 transitions. Second operand  has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 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:17,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-05 19:56:17,781 INFO  L93              Difference]: Finished difference Result 1637 states and 4757 transitions.
[2021-06-05 19:56:17,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-05 19:56:17,781 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 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:17,781 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-05 19:56:17,783 INFO  L225             Difference]: With dead ends: 1637
[2021-06-05 19:56:17,783 INFO  L226             Difference]: Without dead ends: 923
[2021-06-05 19:56:17,783 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 436.4ms TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306
[2021-06-05 19:56:17,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 923 states.
[2021-06-05 19:56:17,797 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923.
[2021-06-05 19:56:17,798 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:17,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2592 transitions.
[2021-06-05 19:56:17,800 INFO  L78                 Accepts]: Start accepts. Automaton has 923 states and 2592 transitions. Word has length 84
[2021-06-05 19:56:17,800 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-05 19:56:17,800 INFO  L482      AbstractCegarLoop]: Abstraction has 923 states and 2592 transitions.
[2021-06-05 19:56:17,801 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 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:17,801 INFO  L276                IsEmpty]: Start isEmpty. Operand 923 states and 2592 transitions.
[2021-06-05 19:56:17,802 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-05 19:56:17,802 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-05 19:56:17,802 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:17,803 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-06-05 19:56:17,803 INFO  L430      AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-05 19:56:17,805 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-05 19:56:17,806 INFO  L82        PathProgramCache]: Analyzing trace with hash -1003033753, now seen corresponding path program 10 times
[2021-06-05 19:56:17,806 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-05 19:56:17,806 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067472677]
[2021-06-05 19:56:17,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-05 19:56:17,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-05 19:56:17,868 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-05 19:56:17,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-05 19:56:17,940 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-05 19:56:18,017 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-05 19:56:18,017 INFO  L655         BasicCegarLoop]: Counterexample might be feasible
[2021-06-05 19:56:18,018 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2021-06-05 19:56:18,018 INFO  L301   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3)
[2021-06-05 19:56:18,020 INFO  L247   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-05 19:56:18,197 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:56:18 BasicIcfg
[2021-06-05 19:56:18,198 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-05 19:56:18,198 INFO  L168              Benchmark]: Toolchain (without parser) took 25049.26 ms. Allocated memory was 343.9 MB in the beginning and 4.8 GB in the end (delta: 4.4 GB). Free memory was 306.2 MB in the beginning and 3.2 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.0 GB.
[2021-06-05 19:56:18,198 INFO  L168              Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 343.9 MB. Free memory was 324.7 MB in the beginning and 324.6 MB in the end (delta: 126.0 kB). There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-05 19:56:18,198 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 571.92 ms. Allocated memory is still 343.9 MB. Free memory was 306.1 MB in the beginning and 299.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:18,199 INFO  L168              Benchmark]: Boogie Procedure Inliner took 59.97 ms. Allocated memory is still 343.9 MB. Free memory was 299.1 MB in the beginning and 296.0 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:18,199 INFO  L168              Benchmark]: Boogie Preprocessor took 37.92 ms. Allocated memory is still 343.9 MB. Free memory was 296.0 MB in the beginning and 292.8 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:18,199 INFO  L168              Benchmark]: RCFGBuilder took 4120.00 ms. Allocated memory was 343.9 MB in the beginning and 448.8 MB in the end (delta: 104.9 MB). Free memory was 292.8 MB in the beginning and 321.5 MB in the end (delta: -28.6 MB). Peak memory consumption was 182.7 MB. Max. memory is 16.0 GB.
[2021-06-05 19:56:18,199 INFO  L168              Benchmark]: TraceAbstraction took 20254.20 ms. Allocated memory was 448.8 MB in the beginning and 4.8 GB in the end (delta: 4.3 GB). Free memory was 320.4 MB in the beginning and 3.2 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.0 GB.
[2021-06-05 19:56:18,199 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.15 ms. Allocated memory is still 343.9 MB. Free memory was 324.7 MB in the beginning and 324.6 MB in the end (delta: 126.0 kB). There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 571.92 ms. Allocated memory is still 343.9 MB. Free memory was 306.1 MB in the beginning and 299.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 59.97 ms. Allocated memory is still 343.9 MB. Free memory was 299.1 MB in the beginning and 296.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 37.92 ms. Allocated memory is still 343.9 MB. Free memory was 296.0 MB in the beginning and 292.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 4120.00 ms. Allocated memory was 343.9 MB in the beginning and 448.8 MB in the end (delta: 104.9 MB). Free memory was 292.8 MB in the beginning and 321.5 MB in the end (delta: -28.6 MB). Peak memory consumption was 182.7 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 20254.20 ms. Allocated memory was 448.8 MB in the beginning and 4.8 GB in the end (delta: 4.3 GB). Free memory was 320.4 MB in the beginning and 3.2 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.5 GB. 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 t2324;
        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(&t2324, ((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 t2325;
        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(&t2325, ((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 t2326;
        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(&t2326, ((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]  EXPR         1  !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]  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]  EXPR         1  !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]  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]  EXPR         1  !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]  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]  EXPR         1  !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]  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]  EXPR         1  !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]  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]  EXPR         1  !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]  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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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]               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]               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]               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]               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]               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]               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=255, 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=255, 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=255, 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: 1364.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 225.4ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1135.5ms, 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: 1638.7ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 33.5ms, AutomataDifference: 388.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 886.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 40 SDslu, 72 SDs, 0 SdLazy, 17 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms 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: 7.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 9.6ms SsaConstructionTime, 71.2ms SatisfiabilityAnalysisTime, 137.5ms 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: 16854.1ms, OverallIterations: 21, TraceHistogramMax: 1, EmptinessCheckTime: 168.7ms, AutomataDifference: 7408.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 804.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2872 SDtfs, 4831 SDslu, 14405 SDs, 0 SdLazy, 2642 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2980.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 5114.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18166occurred in iteration=0, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2395.8ms AutomataMinimizationTime, 20 MinimizatonAttempts, 4679 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 83.6ms SsaConstructionTime, 1275.7ms SatisfiabilityAnalysisTime, 4387.4ms InterpolantComputationTime, 1679 NumberOfCodeBlocks, 1679 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1575 ConstructedInterpolants, 0 QuantifiedInterpolants, 11612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...